计算机工程与应用2019，Vol.55Issue(2)：60-66,7.DOI:10.3778/j.issn.1002-8331.1801-0411
基于边图的线性流重叠社区发现算法
Linear Streaming Algorithm for Overlapping Community Detection Based on Link Graph
摘要
Abstract
Overlapping community detection is a major topic in complex network research. To improve the time efficiency of detection overlapping communities in the network, it proposes a link-based streaming overlapping community detec-tion algorithm called LBSA. The algorithm firstly deals with the edges of the link graph in random order to get the initial communities, then merges the small overlapping communities with other the most similarly large communities. Through those two steps, the algorithm can get the overlapping structure of network with nearly linear time complexity. Experimental results show that the algorithm can detect the overlapping communities in the network with better time efficiency and has good performance compared to the other algorithms.关键词
流式图/重叠社区发现/边聚类系数/边图/社区相似度Key words
graph streaming/overlapping community detection/edge clustering coefficient/link graph/community similarity分类
信息技术与安全科学引用本文复制引用
王斌,李强,盛津芳,孙泽军..基于边图的线性流重叠社区发现算法[J].计算机工程与应用,2019,55(2):60-66,7.基金项目
国家重点研发计划项目(No.2017YFB0802902). （No.2017YFB0802902）
