.png){kind=icon}
返回
A subgraphs-density based overlapping community detection algorithm for large-scale complex networks
.png){kind=icon}
PRE
AI
DOI：10.1007/s00607-022-01121-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Overlapping community detection with low computation is one of the fundamental issues and challenges in large-scale complex network analysis. Detecting a community in a network means discovering a cluster of network nodes so that the density of edges between them is high. The existing methods use entire structure information or subgraphs with a fixed size to detect dense communities. Therefore, they are not efficient and accurate for large-scale networks. In this paper, the authors introduce an overlapping community detection algorithm that gradually improves density estimation by expanding the size of subgraphs and gathering information during the search process for finding communities. It is an efficient algorithm with low computational complexity for complex networks with one hundred thousand to several millions of nodes. Experimental results on synthetic and real-world networks with several hundred to four million nodes validate the performance assessment of the proposed method.
Keyword:
Overlapping-community detection
Local density
Large-scale complex network
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
引用论文
分享收藏分享收藏Palladium and Molybdenum Complexes of the Heteroleptic Organostannylene [2,6-(Me2NCH2)2C6H3]SnCl
PREAI
分享收藏From Louvain to Leiden: guaranteeing well-connected communities从鲁汶到莱顿: 保证良好连接的社区.png)
SCIENTIFIC REPORTS
OAAI
SCIENTIFIC REPORTSIF3.9
OAAI分享收藏
查看更多内容