INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY |
Prev
Next
|
|
|
Detecting community structure using label propagation with consensus weight in complex network |
Liang Zong-Wen (梁宗文)a b, Li Jian-Ping (李建平)a, Yang Fan (杨帆)a, Athina Petropulub |
a School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China; b Electrical and Computer Engineering Department, Rutgers, The State University of New Jersey, NJ 08854, USA |
|
|
Abstract Community detection is a fundamental work to analyse the structural and functional properties of complex networks. The label propagation algorithm (LPA) is a near linear time algorithm to find a good community structure. Despite various subsequent advances, an important issue of this algorithm has not yet been properly addressed. Random update orders within the algorithm severely hamper the stability of the identified community structure. In this paper, we executed the basic label propagation algorithm on networks multiple times, to obtain a set of consensus partitions. Based on these consensus partitions, we created a consensus weighted graph. In this consensus weighted graph, the weight value of the edge was the proportion value that the number of node pairs allocated in the same cluster was divided by the total number of partitions. Then, we introduced consensus weight to indicate the direction of label propagation. In label update steps, by computing the mixing value of consensus weight and label frequency, a node adopted the label which has the maximum mixing value instead of the most frequent one. For extending to different networks, we introduced a proportion parameter to adjust the proportion of consensus weight and label frequency in computing mixing value. Finally, we proposed an approach named the label propagation algorithm with consensus weight (LPAcw), and the experimental results showed that the LPAcw could enhance considerably both the stability and the accuracy of community partitions.
|
Received: 13 January 2014
Revised: 26 March 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 No. 61370073) and the China Scholarship Council, China (Grant No. 201306070037). |
Corresponding Authors:
Liang Zong-Wen
E-mail: zongwen-liang@hotmail.com
|
Cite this article:
Liang Zong-Wen (梁宗文), Li Jian-Ping (李建平), Yang Fan (杨帆), Athina Petropulu Detecting community structure using label propagation with consensus weight in complex network 2014 Chin. Phys. B 23 098902
|
[1] |
Girvan M and Newman M E 2002 Proc. Natl. Acad. Sci. USA 99 7821
|
[2] |
Seifi M, Junier I, Rouquier J B, Iskrov S and Guillaume J L 2013 Complex Networks (Berlin-Heidelberg: Springer) pp. 87-98
|
[3] |
Fortunato S 2010 Phys. Rep. 486 75
|
[4] |
Fortunato S and Castellano C 2012 Computational Complexity (New York: Springer) pp. 490-512
|
[5] |
Zou S R, Peng Y J, Liu A F, Xu X L and He D R 2011 Chin. Phys. B 20 018902
|
[6] |
Tang S X, Chen L and He Y G 2011 Chin. Phys. B 20 110502
|
[7] |
Wang L, Wang J, Shen H W and Cheng X Q 2013 Chin. Phys. B 22 108903
|
[8] |
Blondel V D, Guillaume J L, Lambiotte R and Lefebvre E 2008 J. Stat. Mech.-Theory Exp. 10 P10008
|
[9] |
Newman M E and Girvan M 2004 Phys. Rev. E 69 026113
|
[10] |
Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z and Wagner D 2007 Graph-Theoretic Concepts in Computer Science (Berlin-Heidelberg: Springer) pp. 121-132
|
[10] |
Brandes U, Delling D, Gaertler M, Gorke R, Hoefer M, Nikoloski Z and Wagner D 2007 Graph-Theoretic Concepts in Computer Science (Berlin-Heidelberg: Springer) pp. 121-132
|
[11] |
Fortunato S and Barthelemy M 2007 Proc. Natl. Acad. Sci. USA 104 36
|
[12] |
Guimera R, Sales-Pardo M and Amaral L A N 2004 Phys. Rev. E 70 025101
|
[13] |
Lou H, Li S and Zhao Y 2013 Physica A 392 3095
|
[14] |
Raghavan U N, Albert R and Kumara S 2007 Phys. Rev. E 76 036106
|
[15] |
Šubelj L and Bajec M 2011 Phys. Rev. E 83 036103
|
[16] |
Šubelj L and Bajec M 2011 Eur. Phys. J. B 81 353
|
[17] |
Xie J and Szymanski B K 2013 arXiv.1303.0868
|
[18] |
Topchy A, Jain A K and Punch W 2005 IEEE Trans. Pattern. Anal. Mach. Intell. 27 1866
|
[19] |
Goder A and Filkov V 2008 Alenex 8 109
|
[20] |
Strehl A and Ghosh J 2003 J. Mach. Learn. Res. 3 583
|
[21] |
Lancichinetti A and Fortunato S 2012 Sci. Rep. 2 336
|
[22] |
Monti S, Tamayo P, Mesirov J and Golub T 2003 Mach. Learn. 52 91
|
[23] |
Radicchi F, Castellano C, Cecconi F, Loreto V and Parisi D 2004 Proc. Natl. Acad. Sci. USA 101 2658
|
[24] |
Qinna W and Eric F 2009 ECCS
|
[25] |
Danon L, Diaz-Guilera A, Duch J and Arenas A 2005 J. Stat. Mech.-Theory Exp. 09 P09008
|
[26] |
Liu X and Murata T 2010 IEEE Second International Conference 2010 pp. 576-581
|
[27] |
Leung I X, Hui P, Lio P and Crowcroft J 2009 Phys. Rev. E 79 066107
|
[28] |
Liu X and Murata T 2010 Physica A 389 1493
|
[29] |
Cordasco G and Gargano L 2010 IEEE Int. Workshop Bus. Appl. Soc. Netw. Anal. pp. 1-8
|
[30] |
Shen Y 2013 Chin. Phys. B 22 058903
|
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
|
|
|