计算机科学
分数(化学)
节点(物理)
特征(语言学)
人工智能
机器学习
数据挖掘
语言学
结构工程
工程类
哲学
有机化学
化学
作者
Jierui Xie,Stephen Kelley,Boleslaw Karol Szymanski
出处
期刊:ACM Computing Surveys
[Association for Computing Machinery]
日期:2013-08-01
卷期号:45 (4): 1-35
被引量:1367
标识
DOI:10.1145/2501654.2501657
摘要
This article reviews the state-of-the-art in overlapping community detection algorithms, quality measures, and benchmarks. A thorough comparison of different algorithms (a total of fourteen) is provided. In addition to community-level evaluation, we propose a framework for evaluating algorithms' ability to detect overlapping nodes, which helps to assess overdetection and underdetection. After considering community-level detection performance measured by normalized mutual information, the Omega index, and node-level detection performance measured by F-score, we reached the following conclusions. For low overlapping density networks, SLPA, OSLOM, Game, and COPRA offer better performance than the other tested algorithms. For networks with high overlapping density and high overlapping diversity, both SLPA and Game provide relatively stable performance. However, test results also suggest that the detection in such networks is still not yet fully resolved. A common feature observed by various algorithms in real-world networks is the relatively small fraction of overlapping nodes (typically less than 30%), each of which belongs to only 2 or 3 communities.
科研通智能强力驱动
Strongly Powered by AbleSci AI