Significance-Driven Graph Clustering

12 years 5 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale behind the definition of modularity and explore the founding paradigm. This paradigm is based on the trade-off between the achieved quality and the expected quality of a clustering with respect to networks with similar intrinsic structure. We experimentally evaluate realizations of this paradigm systematically, including modularity, and describe efficient algorithms for their optimization. We confirm the feasibility of the resulting generality by a first systematic analysis of the behavior of these realizations on both artificial and on real-world data, arriving at remarkably good results of community detection.
Marco Gaertler, Robert Görke, Dorothea Wagner
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where AAIM
Authors Marco Gaertler, Robert Görke, Dorothea Wagner
Comments (0)