%0 Generic %1 Noack2008 %A Noack, Andreas %A Rotta, Randolf %D 2008 %K algorithms community comparison detection overview %T Multi-level algorithms for modularity clustering %U http://arxiv.org/abs/0812.4073 %X Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large graphs. A simple and effective class of heuristics coarsens the graph by iteratively merging clusters (starting from singletons), and optionally refines the resulting clustering by iteratively moving individual vertices between clusters. Several heuristics of this type have been proposed in the literature, but little is known about their relative performance. This paper experimentally compares existing and new coarsening- and refinement-based heuristics with respect to their effectiveness (achieved modularity) and efficiency (runtime). Concerning coarsening, it turns out that the most widely used criterion for merging clusters (modularity increase) is outperformed by other simple criteria, and that a recent algorithm by Schuetz and Caflisch is no improvement over simple greedy coarsening for these criteria. Concerning refinement, a new multi-level algorithm is shown to produce significantly better clusterings than conventional single-level algorithms. A comparison with published benchmark results and algorithm implementations shows that combinations of coarsening and multi-level refinement are competitive with the best algorithms in the literature.

@misc{Noack2008, abstract = { Modularity is one of the most widely used quality measures for graph clusterings. Maximizing modularity is NP-hard, and the runtime of exact algorithms is prohibitive for large graphs. A simple and effective class of heuristics coarsens the graph by iteratively merging clusters (starting from singletons), and optionally refines the resulting clustering by iteratively moving individual vertices between clusters. Several heuristics of this type have been proposed in the literature, but little is known about their relative performance. This paper experimentally compares existing and new coarsening- and refinement-based heuristics with respect to their effectiveness (achieved modularity) and efficiency (runtime). Concerning coarsening, it turns out that the most widely used criterion for merging clusters (modularity increase) is outperformed by other simple criteria, and that a recent algorithm by Schuetz and Caflisch is no improvement over simple greedy coarsening for these criteria. Concerning refinement, a new multi-level algorithm is shown to produce significantly better clusterings than conventional single-level algorithms. A comparison with published benchmark results and algorithm implementations shows that combinations of coarsening and multi-level refinement are competitive with the best algorithms in the literature. }, added-at = {2010-07-12T07:07:25.000+0200}, author = {Noack, Andreas and Rotta, Randolf}, biburl = {https://www.bibsonomy.org/bibtex/28344dce0320c367a70f493a1b084b438/folke}, description = {Multi-level algorithms for modularity clustering}, interhash = {6ca3fb96fcfd677aefc0006af5e5b140}, intrahash = {8344dce0320c367a70f493a1b084b438}, keywords = {algorithms community comparison detection overview}, note = {cite arxiv:0812.4073 Comment: 12 pages, 10 figures, see http://www.informatik.tu-cottbus.de/~rrotta/ for downloading the graph clustering software}, timestamp = {2010-07-12T07:07:25.000+0200}, title = {Multi-level algorithms for modularity clustering}, url = {http://arxiv.org/abs/0812.4073}, year = 2008 }