Name
Affiliation
Papers
FRANCESCO GULLO
Yahoo Labs, Spain
68
Collaborators
Citations 
PageRank 
95
483
32.63
Referers 
Referees 
References 
900
1766
1304
Search Limit
1001000
Title
Citations
PageRank
Year
Span-core Decomposition for Temporal Networks: Algorithms and Applications00.342021
Correlation Clustering with Global Weight Bounds00.342021
Garnlp: A Natural Language Processing Pipeline For Garnishment Documents00.342021
Advancing Receivable Financing via a Network-based Approach00.342021
Mining Data for Financial Applications - 4th ECML PKDD Workshop, MIDAS 2019, Würzburg, Germany, September 16, 2019, Revised Selected Papers00.342020
In and Out: Optimizing Overall Interaction in Probabilistic Graphs under Clustering Constraints00.342020
Improving News Personalization Through Search Logs.00.342020
The importance of unexpectedness: Discovering buzzing stories in anomalous temporal graphs.10.342019
ECML PKDD 2018 Workshops - MIDAS 2018 and PAP 2018, Dublin, Ireland, September 10-14, 2018, Proceedings00.342019
Mining (maximal) span-cores from temporal networks.70.392018
Network-based Receivable Financing.00.342018
Probabilistic Causal Analysis of Social Influence.10.352018
Core Decomposition in Multilayer Networks: Theory, Algorithms, and Applications20.352018
Conditional Reliability in Uncertain Graphs.30.412018
To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem.50.392017
Core Decomposition and Densest Subgraph in Multilayer Networks.70.392017
An information-theoretic approach to hierarchical clustering of uncertain data.30.382017
Exploiting search history of users for news personalization.60.412017
HERMEVENT: a news collection for emerging-event detection00.342017
The Projective Clustering Ensemble Problem for Advanced Data Clustering.00.342017
Ensemble-based community detection in multilayer networks.40.392017
Advancing Nlp Via A Distributed-Messaging Approach10.352016
Graph-Based Breaking News Detection on Wikipedia.10.352016
Hermes: A Distributed-Messaging Tool for NLP.00.342016
Identifying Buzzing Stories via Anomalous Temporal Subgraph Discovery20.352016
Handling Uncertainty in Clustering Art-Exhibition Visiting Styles00.342016
MultiClust 2013: Multiple Clusterings, Multiview Data, and Multisource Knowledgedriven Clustering: [Workshop Report].00.342016
Metacluster-based Projective Clustering Ensembles30.362015
DifRec: A Social-Diffusion-Aware Recommender System10.362015
Graph Query Reformulation with Diversity120.522015
Finding Subgraphs with Maximum Total Density and Limited Overlap280.782015
The Minimum Wiener Connector Problem80.432015
Top-k Reliable Edge Colors in Uncertain Graphs10.362015
Efficient and effective community search290.722015
The Minimum Wiener Connector.20.352015
Uncertain Graph Processing through Representative Instances60.462015
The pursuit of a good possible world: extracting representative instances of uncertain graphs110.572014
Distance oracles in edge-labeled graphs.90.552014
Fast Reliability Search in Uncertain Graphs.150.552014
Core decomposition of uncertain graphs381.012014
Be Certain of How-to before Mining Uncertain Data.00.342014
Minimizing the Variance of Cluster Mixture Models for Clustering Uncertain Objects80.572013
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees1022.582013
A Tensor-based Clustering Approach for Multiple Document Classifications.10.352013
Projective clustering ensembles30.382013
Mining Summaries of Propagations50.492013
Uncertain centroid based partitional clustering of uncertain data110.592012
Chromatic correlation clustering.10.362012
Uncertain Centroid based Partitional Clustering of Uncertain Data.00.342012
Multiobjective optimization of co-clustering ensembles20.372012
  • 1
  • 2