A Comparison of Agglomerative Hierarchical Algorithms for Modularity Clustering
Modularity is a popular measure for the quality of a cluster partition. Primarily, its popularity originates from its suitability for community identification through maximization. A lot of algorithms to maximize modularity have been proposed in recent years. Especially agglomerative hierarchical algorithms showed to be fast and find clusterings with high modularity. In this paper we present several of these heuristics, discuss their problems and point out why some algorithms perform better than others. In particular, we analyze the influence of search heuristics on the balancedness of the merge process and show why the uneven contraction of a graph due to an unbalanced merge process leads to clusterings with comparable low modularity.
KeywordsModularity Maximization Cluster Partition Divisive Algorithm Cluster Pair Singleton Cluster
The research leading to these results has received funding from the European Community’s Seventh Framework Programme FP7/2007-2013 under grant agreement n ∘ 215453 - WeKnowIt.
- Boguñá M, Pastor-Satorras R, Díaz-Guilera A, Arenas A (2004) Models of social networks based on social distance attachment. Phys Rev E 70(5):056,122Google Scholar
- Clauset A, Newman MEJ, Moore C (2004) Finding community structure in very large networks. Phys Rev E 70Google Scholar
- Duch J, Arenas A (2005) Community detection in complex networks using extremal optimization. Phys Rev E 72(2):027,104Google Scholar
- Lü Z, Huang W (2009) Iterated tabu search for identifying community structure in complex networks. Phys Rev E 80(2):026,130Google Scholar
- Medus A, Acuña G, Dorso C (2005) Detection of community structures in networks via global optimization. Phys A 358(2-4):593–604Google Scholar
- Newman MEJ (2004) Fast algorithm for detecting community structure in networks. Phys Rev E 69Google Scholar
- Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E 69(2):026,113Google Scholar
- Ovelgönne M, Geyer-Schulz A (2010) Cluster cores and modularity maximization. In: ICDMW ’10. IEEE International Conference on Data Mining Workshops, pp 1204–1213Google Scholar
- Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76(3):036,106Google Scholar
- Schuetz P, Caflisch A (2008) Efficient modularity optimization by multistep greedy algorithm and vertex mover refinement. Phys Rev E 77Google Scholar
- Wakita K, Tsurumi T (2007) Finding community structure in mega-scale social networks. CoRR abs/cs/0702048, http://arxiv.org/abs/cs/0702048
- White S, Smyth P (2005) A spectral clustering approach to finding communities in graphs. In: Proceedings of the Fifth SIAM International Conference on Data Mining, SIAM, pp 274–285Google Scholar