A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
SIAM Journal on Scientific Computing
The boost graph library: user guide and reference manual
The boost graph library: user guide and reference manual
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm
SIAM Journal on Scientific Computing
On clusterings: Good, bad and spectral
Journal of the ACM (JACM)
Engineering graph clustering: Models and experimental evaluation
Journal of Experimental Algorithmics (JEA)
IEEE Transactions on Knowledge and Data Engineering
Significance-Driven Graph Clustering
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection
Algorithms and Models for the Web-Graph
Engineering Comparators for Graph Clusterings
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Computer Science Review
A new methodology for constructing a publication-level classification system of science
Journal of the American Society for Information Science and Technology
Static and Dynamic Aspects of Scientific Collaboration Networks
ASONAM '12 Proceedings of the 2012 International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2012)
Graph-based Sybil detection in social and information systems
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
| Hi-index | 0.00 |
Modularity is a widely used quality measure for graph clusterings. Its exact maximization is NP-hard and prohibitively expensive for large graphs. Popular heuristics first perform a coarsening phase, where local search starting from singleton clusters is used to compute a preliminary clustering, and then optionally a refinement phase, where this clustering is improved by moving vertices between clusters. As a generalization, multilevel heuristics coarsen in several stages, and refine by moving entire clusters from each of these stages, not only individual vertices. This article organizes existing and new single-level and multilevel heuristics into a coherent design space, and compares them experimentally with respect to their effectiveness (achieved modularity) and runtime. For coarsening by iterated cluster joining, it turns out that the most widely used criterion for joining clusters (modularity increase) is outperformed by other simple criteria, that a recent multistep algorithm [Schuetz and Caflisch 2008] is no improvement over simple single-step coarsening for these criteria, and that the recent multilevel coarsening by iterated vertex moving [Blondel et al. 2008] is somewhat faster but slightly less effective (with refinement). The new multilevel refinement is significantly more effective than the conventional single-level refinement or no refinement, in reasonable runtime. A comparison with published benchmark results and algorithm implementations shows that multilevel local search heuristics, despite their relative simplicity, are competitive with the best algorithms in the literature.