INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY |
Prev
Next
|
|
|
Detecting overlapping communities in networks via dominant label propagation |
Sun He-Li (孙鹤立)a b, Huang Jian-Bin (黄健斌)b c, Tian Yong-Qiang (田勇强)c, Song Qin-Bao (宋擒豹)a, Liu Huai-Liang (刘怀亮)d |
a Department of Computer Science and Technology, Xi'an Jiaotong University, Xi'an 710049, China; b State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China; c School of Software, Xidian University, Xi'an 710071, China; d School of Economics and Management, Xidian University, Xi'an 710071, China |
|
|
Abstract Community detection is an important methodology for understanding the intrinsic structure and function of a real-world network. In this paper, we propose an effective and efficient algorithm, called Dominant Label Propagation Algorithm (Abbreviated as DLPA), to detect communities in complex networks. The algorithm simulates a special voting process to detect overlapping and non-overlapping community structure in complex networks simultaneously. Our algorithm is very efficient, since its computational complexity is almost linear to the number of edges in the network. Experimental results on both real-world and synthetic networks show that our algorithm also possesses high accuracies on detecting community structure in networks.
|
Received: 14 July 2014
Revised: 15 August 2014
Accepted manuscript online:
|
PACS:
|
89.75.Fb
|
(Structures and organization in complex systems)
|
|
89.75.Hc
|
(Networks and genealogical trees)
|
|
Fund: Project supported by the National Natural Science Foundation of China (Grant Nos. 61173093 and 61202182), the Postdoctoral Science Foundation of China (Grant No. 2012 M521776), the Fundamental Research Funds for the Central Universities of China, the Postdoctoral Science Foundation of Shannxi Province, China, and the Natural Science Basic Research Plan of Shaanxi Province, China (Grant Nos. 2013JM8019 and 2014JQ8359). |
Corresponding Authors:
Sun He-Li
E-mail: hlsun@mail.xjtu.edu.cn
|
Cite this article:
Sun He-Li (孙鹤立), Huang Jian-Bin (黄健斌), Tian Yong-Qiang (田勇强), Song Qin-Bao (宋擒豹), Liu Huai-Liang (刘怀亮) Detecting overlapping communities in networks via dominant label propagation 2015 Chin. Phys. B 24 018703
|
[1] |
Clauset A, Newman M E J and Moore C 2004 Phys. Rev. E 70 066111
|
[2] |
Raghavan U N, Albert R and Kumara S 2007 Phys. Rev. E 76 036106
|
[3] |
Rosvall M and Bergstrom C T 2008 Proc. Natl. Acad. Sci. USA 105 1118
|
[4] |
Huang J B, Sun H L, Song Q B, Deng H B and Han J W 2013 IEEE Trans. Knowl. Data Eng. 25 1876
|
[5] |
Baumes J, Goldberg M and Malik M I 2005 Intelligence and Security Informatics (Berlin: Springer) pp. 27-36
|
[6] |
Steve G 2010 New J. Phys. 12 103018
|
[7] |
Lancichinetti A and Fortunato S 2009 Phys. Rev. E 80 016118
|
[8] |
Lee C, Reid F, McDaid A and Hurley N 2010 arXiv:1002.1827
|
[9] |
Palla G, Derényi I, Farkas I and Vicsek T 2005 Nature 435 814
|
[10] |
Xie J R, Szymanski B K and Liu X M 2011 Proceedings of the 11th International Conference on Data Mining Workshops, December 11-14, 2011 Canada, pp. 344-349
|
[11] |
Liang Z W, Li J P, Yang F and Athina P 2014 Chin. Phys. B 23 098902
|
[12] |
Zhang C, Shen H Z, Li F and Yang H Q 2012 Acta Phys. Sin. 61 148902 (in Chinese)
|
[13] |
Liu X, Xie Z and Yi D Y 2012 Chin. Phys. Lett. 29 048902
|
[14] |
Yuan C and Chai 2012 Acta Phys. Sin. 61 218901 (in Chinese)
|
[15] |
Shen Y and Xu H L 2010 Acta Phys. Sin. 59 6022 (in Chinese)
|
[16] |
Huang J B, Sun H L, Liu Y G, Song Q B and Weninger T 2011 PloS One 6 e23829
|
[17] |
Ahn Y Y, Bagrow J P and Lehmann S 2010 Nature 466 761
|
[18] |
Psorakis I, Roberts S, Ebden M and Sheldon B 2011 Phys. Rev. E 83 066114
|
[19] |
Coscia M, Rossetti G, Giannotti F and Pedreschi D 2012 Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, August 12-16, 2012 China, p. 615
|
[20] |
Adamcsek B, Palla G, Farkas I J, Derényi I and Vicsek T 2006 Bioinformatics 22 1021
|
[21] |
http://snap.stanford.edu/data/
|
[22] |
http://www-personal.umich.edu/ mejn/netdata/
|
[23] |
Lancichinetti A, Fortunato S and Radicchi F 2008 Phys. Rev. E 78 046110
|
[24] |
Newman M E J 2006 Proc. Natl. Acad. Sci. USA 103 8577
|
[25] |
Nicosia V, Mangioni G, Carchiolo V and Malgeri M 2009 J. Stat. Mech. 23 03024
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|