Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, particularly in the complex systems literature, although its properties are not well understood. We study the problem of finding clusterings with maximum modularity, thus providing theoretical foundations for past and present work based on this measure. More precisely, we prove the conjectured hardness of maximizing modularity both in the general case and with the restriction to cuts and give an Integer Linear Programming formulation. This is complemented by first insights into the behavior and performance of the commonly applied greedy agglomerative approach.
On Modularity Clustering
U. Brandes,Daniel Delling,M. Gaertler,Robert Görke,M. Hoefer,Z. Nikoloski,D. Wagner
Published 2008 in IEEE Transactions on Knowledge and Data Engineering
ABSTRACT
PUBLICATION RECORD
- Publication year
2008
- Venue
IEEE Transactions on Knowledge and Data Engineering
- Publication date
2008-02-01
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-30 of 30 references · Page 1 of 1