电子学报Issue(8)：1575-1582,8.DOI:10.3969/j.issn.0372-2112.2015.08.016
大规模复杂网络下重叠社区的识别
The Identification of OverIapping Communities in Large-ScaIe CompIex Networks
摘要
Abstract
With the unceasing expanding of network scale,many classic detection algorithms of overlapping communities cannot work efficiently in large-scale complex network.Detecting the overlapping community algorithm based on vital node expand-ing in parallel framework GraphLab (DOCVN)is introduced to identify the overlapping communities.In this algorithm,nodes with high PageRank value are regarded as vital nodes,and then the affiliation degree of other nodes to these vital nodes are computed. After that,kernel communities and expanding communities are identified respectively.Finally,the kernel communities and expanding communities are combined into some overlapping communities by judging whether they connect tightly.And the importance weight of each node in its community is also computed.Experimental results show that the algorithm is more effective than the existing par-allel algorithms like PD (Propinquity Dynamics)to identify large-scale overlapping communities.关键词
大规模复杂网络/GraphLab/重叠社区识别/社会网络/核心社区Key words
large-scale complex network/GraphLab/overlapping community identification/social network/kernel communi-ty分类
信息技术与安全科学引用本文复制引用
王诗懿,董一鸿,李志超,陈华辉,钱江波..大规模复杂网络下重叠社区的识别[J].电子学报,2015,(8):1575-1582,8.基金项目
国家自然科学基金（No．61472194）；浙江省自然科学基金（No．LY13F020040）；宁波市自然科学基金 （）
