计算机科学 ›› 2015, Vol. 42 ›› Issue (1): 119-121.doi: 10.11896/j.issn.1002-137X.2015.01.028

• 网络与通信 • 上一篇    下一篇

基于核心图的标签传播算法

马杰良,韩路,潘贞贞,宋艳   

  1. 南京信息工程大学信息与控制学院 南京210044,南京信息工程大学电子与信息工程学院 南京210044,南京信息工程大学电子与信息工程学院 南京210044,南京信息工程大学电子与信息工程学院 南京210044
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金(61372128)资助

Label Propagation Algorithm Based on Community Core for Community Detection

MA Jie-liang, HAN Lu, PAN Zhen-zhen and SONG Yan   

  • Online:2018-11-14 Published:2018-11-14

摘要: 网络中的社团发现是当前的一个研究热点。在众多社团发现算法中,标签传播算法因简单快速而被广泛应用,但标签传播算法也存在结果稳定性较差的问题。基于此对标签传播算法的初始化过程进行改进,提出了基于核心图的标签传播算法。通过计算图中任意两点的k阶公共邻居,将具有最大相似性的节点及k阶邻居作为初始核心社团,并为其分配初始标签。通过上述过程,提取一些较为紧密的子结构来作为标签传播的初始社团,并给这些结构分配初始社团标签。在真实网络中的实验结果表明,该算法可以大幅提高结果的稳定性。

关键词: 社团发现,标签传播,相似性,核心图

Abstract: Community detection in networks is a hot research topic currently.Among many community detection algorithms,label propagation algorithm is widely used for it is simple and rapid.But label propagation algorithm also has the problem of poor stability result.Therefore,we improved the initialization process of label propagation algorithm.We proposed a label propagation algorithm based on community core for community detection,and by calculating any two nodes’s k order common neighbor,we used the most sililar nodes and it’s k order neighbor nodes as the initial community core.According the above process,we got some tight structure as the initial label of label propagation,and assigned the initial community label to these structures.Experimental results in a real network show that the algorithm can improve the stability of the results.

Key words: Community detection,Label propagation,Similarity,Community core

[1] Zhao Y P,Levina E,Zhu J.Community extraction for social networks[J].Proceedings of the National Academy of Sciences of the United States of America,2011,108(18):7321-7326
[2] Kelley S,Goldberg M,Magdon-Ismail M,et al.Defining anddiscovering communities in social networks[J].Handbook of Optimization in Complex Networks,2012,57(2):139-168
[3] Angeles S M,Boguna M,Sagues F.Uncovering the hidden geo-metry behind metabolic networks[J].Molecular BioSystems,2012,8(3):843-850
[4] Ino H,Kudo M,Nakamura A.Partitioning of Web graphs by community topology[C]∥Proceedings of the 14th International Conference on World Wide Web.New York:ACM,2005:661-669
[5] Farutin V,Robison K,Lightcap E,et al.Edge-count probabili-ties for the identication of local protein communities and their organization[J].Proteins:Structure,Function,and Bioinforma-tics,2006,62(3):800-818
[6] Newman M E J.Modularity and communities structure in networks [J].Proceedings of the National Academy of Science,2006,3(23):8577-8582
[7] Guimera R,Amaral L.Functional cartography of complex metabolic networks[J].Nature,2005,3(7028):895-900
[8] Flake G W,Lawrence S,Giles C L,et al.Self-organization andidentification of Web communities[J].IEEE Computer,2002,5(3):66-71
[9] Kleinberg J M.Authoritative sources in a hyperlinked environment[J].Journal of the ACM,1999,6(5):604-632
[10] Palla G,Derenyi I,Farkas I,et al.Uncovering the overlapping community structures of complex networks in nature and society [J].Nature,2005,5(7043):814-818
[11] Raghavan U N,Albert P,Kumara S.Near linear time algorithm to detect community structure in larger-scale networks[J].Physical review E,2007,6(3):036106
[12] Zachary W W.An information flow model for conflict and fissionin small groups[J].Journal of Anthropological Research,1977,3(4):452-473
[13] Lusseau D.The emergent properties of a dolphin social network[J].Proceedings of the Royal Society B:Biological Sciences,2003,270(S2):186-188
[14] Girvan M,Newman M E J.Community structure in social and biological networks[J].Proc.Natl.Acad.Sci.,2002,99:7821-7826

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!