.png){kind=icon}
返回
On modularity clustering
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2007.190689.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
graph clustering
graph partitioning
modularity
community structure
greedy algorithm
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Networks of bZIP Protein-Protein Interactions Diversified Over a Billion Years of Evolution.png)
ScienceOAAI
ScienceIF0
OAAI分享收藏
A multi-task neural network for multilingual sentiment classification and language detection on Twitter用于Twitter多语言情感分类和语言检测的多任务神经网络
PREAI
分享收藏
查看更多内容