Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient

被引：53
|
作者：
Cui, Yaozu [1 ]
Wang, Xingyuan [1 ]
Li, Junqiu [1 ]
机构：
[1] Dalian Univ Technol, Fac Elect Informat & Elect Engn, Dalian 116024, Peoples R China
来源：
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS | 2014年 / 405卷
基金：
中国国家自然科学基金;
关键词：
Complex network; Community structures; Maximal sub-graph; Clustering coefficient; COMPLEX; RESOLUTION; MODEL;
D O I：
10.1016/j.physa.2014.03.027
中图分类号：
O4 [物理学];
学科分类号：
0702 ;
摘要：
In this paper, we present an alternate algorithm for detecting overlapping community structures in the complex network. Two concepts named the maximal sub-graph and the clustering coefficient between two neighboring communities are introduced. First, all the maximal sub-graphs are extracted from the original networks and then merge them by considering the clustering coefficient of two neighboring maximal sub-graphs. And a new extended modularity is proposed to quantify this algorithm. The other advantage of this algorithm is that the overlapping vertex can be detected. The effectiveness of our algorithm is tested on some real networks. Finally, we compare the computational complexity of this algorithm with selected close related algorithms. The results show that this algorithm gives satisfactory results. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码：85 / 91
页数：7
相关论文
共 50 条
  • [1] ODES: an overlapping dense sub-graph algorithm
    Long, James
    Hartman, Chris
    [J]. BIOINFORMATICS, 2010, 26 (21) : 2788 - 2789
  • [2] Maximal Frequent Sub-graph Mining for Malware Detection
    Hellal, Aya
    Ben Romdhane, Lotfi
    [J]. 2015 15TH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS (ISDA), 2015, : 31 - 39
  • [3] Robust Spectral Clustering Using Statistical Sub-Graph Affinity Model
    Eichel, Justin A.
    Wong, Alexander
    Fieguth, Paul
    Clausi, David A.
    [J]. PLOS ONE, 2013, 8 (12):
  • [4] Algorithm for detecting complete sub-graph in complex network
    Dept. of Electronic Machinery and Transportation Engineering, Guilin University of Electronic Technology, Guilin 541004, China
    不详
    [J]. Yi Qi Yi Biao Xue Bao, 2006, SUPPL. (925-927):
  • [5] Detecting Overlapping Communities in Networks Using Spectral Methods
    Zhang, Yuan
    Levina, Elizaveta
    Zhu, Ji
    [J]. SIAM JOURNAL ON MATHEMATICS OF DATA SCIENCE, 2020, 2 (02): : 265 - 283
  • [6] Detecting overlapping communities in massive networks
    Sun, Bing-Jie
    Shen, Hua-Wei
    Cheng, Xue-Qi
    [J]. EPL, 2014, 108 (06)
  • [7] Label propagation based evolutionary clustering for detecting overlapping and non-overlapping communities in dynamic networks
    Liu, Ke
    Huang, Jianbin
    Sun, Heli
    Wan, Mengjie
    Qi, Yutao
    Li, He
    [J]. KNOWLEDGE-BASED SYSTEMS, 2015, 89 : 487 - 496
  • [8] Detecting Overlapping Communities in Social Networks using Deep Learning
    Salehi, S. M. M.
    Pouyan, A. A.
    [J]. INTERNATIONAL JOURNAL OF ENGINEERING, 2020, 33 (03): : 366 - 376
  • [9] Robust Spectral Clustering Incorporating Statistical Sub-Graph Affinity Model
    Lin, Zhenxian
    Wang, Jiagang
    Wu, Chengmao
    [J]. AXIOMS, 2022, 11 (06)
  • [10] AGGLOMERATIVE CLUSTERING BASED ON LABEL PROPAGATION FOR DETECTING OVERLAPPING AND HIERARCHICAL COMMUNITIES IN COMPLEX NETWORKS
    Zhao, Yuxin
    Li, Shenghong
    Wang, Shilin
    [J]. ADVANCES IN COMPLEX SYSTEMS, 2014, 17 (06):
12345