A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Cluster-aware iterative improvement techniques for partitioning large VLSI circuits
ACM Transactions on Design Automation of Electronic Systems (TODAES)
On clusterings-good, bad and spectral
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Iterative Cluster Analysis of Protein Interaction Data
Bioinformatics
Propagating distributions on a hypergraph by dual information regularization
ICML '05 Proceedings of the 22nd international conference on Machine learning
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Statistical properties of community structure in large social and information networks
Proceedings of the 17th international conference on World Wide Web
Markov clustering of protein interaction networks with improved balance and scalability
Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology
The impact of unlinkability on adversarial community detection: effects and countermeasures
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Scalable discovery of best clusters on large graphs
Proceedings of the VLDB Endowment
HADI: Mining Radii of Large Graphs
ACM Transactions on Knowledge Discovery from Data (TKDD)
Symmetrizations for clustering directed graphs
Proceedings of the 14th International Conference on Extending Database Technology
Local graph sparsification for scalable clustering
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Diversified ranking on large graphs: an optimization viewpoint
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
On clustering heterogeneous social media objects with outlier links
Proceedings of the fifth ACM international conference on Web search and data mining
EigenSpokes: surprising patterns and scalable community chipping in large graphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
V-SMART-join: a scalable mapreduce framework for all-pair similarity joins of multisets and vectors
Proceedings of the VLDB Endowment
Finding maximal k-edge-connected subgraphs from a large graph
Proceedings of the 15th International Conference on Extending Database Technology
Semi-supervised clustering of graph objects: a subgraph mining approach
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part I
Quantifying reciprocity in large weighted communication networks
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Visual spam campaigns analysis using abstract graphs representation
Proceedings of the Ninth International Symposium on Visualization for Cyber Security
Combining Relations and Text in Scientific Network Clustering
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Social influence based clustering of heterogeneous information networks
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
Efficient community detection in large networks using content and links
Proceedings of the 22nd international conference on World Wide Web
Identifying protein complexes in AP-MS data with negative evidence via soft Markov clustering
Proceedings of the International Conference on Bioinformatics, Computational Biology and Biomedical Informatics
Detecting cohesive and 2-mode communities indirected and undirected networks
Proceedings of the 7th ACM international conference on Web search and data mining
Efficient eigen-updating for spectral graph clustering
Neurocomputing
Assessing the quality of multilevel graph clustering
Data Mining and Knowledge Discovery
| Hi-index | 0.00 |
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of scalability and fragmentation of output. In this article we present a multi-level algorithm for graph clustering using flows that delivers significant improvements in both quality and speed. The graph is first successively coarsened to a manageable size, and a small number of iterations of flow simulation is performed on the coarse graph. The graph is then successively refined, with flows from the previous graph used as initializations for brief flow simulations on each of the intermediate graphs. When we reach the final refined graph, the algorithm is run to convergence and the high-flow regions are clustered together, with regions without any flow forming the natural boundaries of the clusters. Extensive experimental results on several real and synthetic datasets demonstrate the effectiveness of our approach when compared to state-of-the-art algorithms.