期刊文献+

基于标签影响力的半同步社区发现算法 被引量:6

Semi-synchronous communities detection algorithm based on label influence
下载PDF
导出
摘要 微博网络与社交网络等的交互式社会信息网络规模的快速增长对社区发现提出巨大挑战。标签传播算法(LPA)虽然在时间复杂度上具有很大的优势,但是其内在的多种随机策略使得算法稳定性不高。针对LPA的随机问题,提出了一种基于影响力的半同步标签传播算法(ISLPA),能有效地避免振荡问题,巧妙地实现了相邻节点之间的同步更新,并结合影响力从初始标签、选择邻居节点和更新顺序三方面进行了改进,摒弃了原有的随机策略。真实网络和人工网络的实验结果表明,ISLPA具有较高的稳定性与有效性,与其他LPA相关算法相比存在明显的优势。 It is a great challenge to discover communities in the fast growing large-scale interactive social information networks such as Weibo and social networks. Although Label Propagation Algorithm( LPA) has great advantage in time complexity,but its inherent multiple random strategies make the algorithm unstable. In order to solve the problem,a semisynchronous label propagation algorithm named Influence-driven Semi-synchronous Label Propagation Algorithm( ISLPA) was proposed. The propagation oscillation was avoided effectively and the synchronous update between neighbor nodes was realized by abandoning the original random strategy and integrating node influence into label initialization,neighbor node selection and updated order determination. The experimental results from the real-world and artificial networks indicate that,in terms of validity and stability of generated communities from the networks,the proposed ISLPA outperforms the currently typical LPAs used in community detection.
出处 《计算机应用》 CSCD 北大核心 2016年第6期1573-1578,1587,共7页 journal of Computer Applications
基金 国家自然科学基金资助项目(61363037) 教育部人文社会科学研究青年基金资助项目(12YJCZH074) 福建省教育厅A类项目(JA13077)~~
关键词 社区发现 标签传播法 半同步 节点影响力 振荡 community detection Label Propagation Algorithm(LPA) semi-synchronization node influence oscillation
  • 相关文献

参考文献21

  • 1FORTUNATO S. Community detection in graphs [ J]. Physics Re- ports, 2009, 486(3/4/5): 75-174.
  • 2COSCIA M, GIANNOT1] F, PEDRESCHI D. A classification for community discovery methods in complex networks [ J]. Statistical Analysis & Data Mining the Asa Data Science Journal, 2011, 4 (5) : 512 -546.
  • 3黄发良.信息网络的社区发现及其应用研究[J].复杂系统与复杂性科学,2010,7(1):64-74. 被引量:19
  • 4GIRVAN M, NEWMAN M E J. Community structure in social and biological networks [ J]. Proceedings {ff the National Academy of Sciences, 2002, 99(12): 7821-7826.
  • 5CLAUSET A, NEWMAN M E J, MOORE C. Finding community structure in very large networks [ J]. Physical Review E, Statistical Nonlinear, and Soft Matter Physics, 2004, 70(6 Pt 2): 066111.
  • 6RAGHAVAN U N, ALBERT R, KUMARA S. Near linear time al- gorithm to detect community structures in large-scale networks [ J]. Physical Review E, Statistical Nonlinear, and Soft Matter Physics, 2007, 76(3 Pt 2): 036106.
  • 7SUBELJ L, BAJEC M. Unfolding communities in large complex net- works: Combining defensive and offensive label propagation for core extraction [ J]. Physical Review E, Statistical Nonlinear, and Soft Matter Physics, 2011, 83(3 Pt2): 036103.
  • 8LEUNG I X, HUI P, LIO P, et al. Towards real-time community detection in large networks [ J]. Physical Review E, Statistical Non- linear, and Soft Matter Physics, 2009, 79(6 Pt 2) : 066107.
  • 9ZHANG X K, FEI S, SONG C, et al. Label propagation algorithm based on local cycles for community detection [ J]. International Journal of Modern Physics B, 2015, 29(5) : 1550029.
  • 10LIN Z, ZHENG X, XIN N, et al. CK-LPA: efficient community detection algorithm based on label propagation with community ker- nel [ J]. Physica A: Statistical Mechanics & Its Applications, 2014, 416:386-399.

二级参考文献73

  • 1高琰,谷士文,唐琎.基于链接分析的Web社区发现技术的研究[J].计算机应用研究,2006,23(7):183-185. 被引量:17
  • 2Luce R D,Perry A D. A method of matrix analysis of group structure[J]. Psychometrika,1949,14(2) : 95 -116.
  • 3Alba R D. A graph-theoretic definition of a sociometric clique[ J]. J Math Sociol, 1973,3 (1) : 113 -126.
  • 4Luce R D. Connectivity and generalized cliques in sociometric group structure[J]. Psychometrika, 1950, 15 (2) :169 -190.
  • 5Mokken R J. Cliques, clubs and clans[J]. Quality and Quantity, 1979,13(2) : 161 - 173.
  • 6Seidman S B, Foster B L. A graph-theoretic generalization of the clique concept[ J]. J Math Sociol. 1978, 6:139 -154.
  • 7Seidman S B. Network structure and minimum degree[ J]. Soc Netw, 1983,5:269 -287.
  • 8Luccio F, Sami M. On the decomposition of networks into minimally interconnected networks[ J]. IEEE Trans Circuit Theory, 1969, 2(16) : 184 -188.
  • 9Radicchi F, Castellano C, Cecconi F, et al. Defining and identifying communities in networks[J]. PNAS, 2004, 101 (9): 2658 - 2663.
  • 10Hu Y Q, Chen H B, Zhang P, et al. Comparative definition of community and corresponding identifying algorithm[J]. Phys Rev E, 2008, 78(2) :026121.

共引文献54

同被引文献23

引证文献6

二级引证文献21

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部