Research on label propagation algorithm based on modularity maximization in the social network

被引:0
|
作者
Chen J. [1 ,2 ]
Wan Y. [1 ]
机构
[1] College of Information Science and Engineering, Yanshan University, Qinhuangdao
[2] Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Qinhuangdao
来源
| 1600年 / Editorial Board of Journal on Communications卷 / 38期
基金
中国国家自然科学基金;
关键词
Community detection; Community structure; Label propagation; Modularity; Propagation distance;
D O I
10.11959/j.issn.1000-436x.2017025
中图分类号
学科分类号
摘要
A kind of community detection method based on the combination of modularity and community structure attributes was proposed. Firstly, updating the whole network after communities merging every time could result in the high time complexity, therefore, introducing propagation distance parameter and "merger going after label propagation" was utilized to reduce time complexity. Secondly, CDMM-LPA algorithm was proposed by combing label propagation with community structure. Finally, empirical analysis on data networks verified the validity of the approaches. The experimental results show that the CDMM-LPA algorithm has a high modularity value and a more stable community structure while reducing the time complexity. © 2017, Editorial Board of Journal on Communications. All right reserved.
引用
收藏
页码:25 / 33
页数:8
相关论文
共 18 条
  • [1] Liu Y.T., Research on social network structure, (2008)
  • [2] Scott J., Social Network Analysis, (2013)
  • [3] Kernighan B.W., Lin S., An efficient heuristic procedure for partitioning graphs, Bell System Technical Journal, 49, 2, pp. 291-307, (1970)
  • [4] Pothen A., Simon H.D., Liou K.P., Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications, 11, 3, pp. 430-452, (1990)
  • [5] Newman M.E.J., Analysis of weighted networks, Physical Review E, 70, 5, (2004)
  • [6] Clauset A., Newman M.E.J., Moore C., Finding community structure in very large networks, Physical Review E, 70, 6, (2004)
  • [7] Zhu X., Ghahramani Z., Learning from labeled and unlabeled data with label propagation, (2002)
  • [8] Raghavan U.N., Albert R., Kumara S., Near linear time algorithm to detect community structures in large-scale networks, Physical Review E, 76, 3, (2007)
  • [9] Zhao Z.X., Wang Y.T., Tian J.T., A novel algorithm for community discovery in social networks based on label propagation, Journal of Computer Research and Development, 48, pp. 8-15, (2011)
  • [10] Lou H., Li S.H., Zhao Y.X., Detecting community structure using label propagation with weighted coherent neighborhood propinquity, Physica A, 392, pp. 3095-3105, (2013)