.png){kind=icon}
Return
On modularity clustering
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2007.190689.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
graph clustering
graph partitioning
modularity
community structure
greedy algorithm
Journal
IF:
10.4
Papers:
6.9K
Citations:
3.2W
Organization
View more organizations
Cited Papers
Networks of bZIP Protein-Protein Interactions Diversified Over a Billion Years of Evolution.png)
ScienceOAAI
ScienceIF0
OAAIShareSave
ShareSaveShareSaveShareSaveShareSave View more