One of the most useful measures of cluster quality is the modularity of the partition, which measures the difference between the number of the edges joining vertices from the same cluster and the expected number of such edges in a random (unstructured) graph. In this paper we show that the problem of finding a partition maximizing the modularity of a given graph G can be reduced to a minimum weighted cut problem on a complete graph with the same vertices as G. We then show that the resulted minimum cut problem can be efficiently solved with existing software for graph partitioning and that our algorithm finds clusterings of a better quality and much faster than the existing clustering algorithms. © 2008 Springer-Verlag.
CITATION STYLE
Djidjev, H. N. (2008). A scalable multilevel algorithm for graph clustering and community structure detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4936 LNCS, pp. 117–128). https://doi.org/10.1007/978-3-540-78808-9_11
Mendeley helps you to discover research relevant for your work.