Abstract
The complexity of many community detection algorithms is usually an exponential function with the scale which hard to uncover community structure with high speed. Inspired by the ideas of the famous modularity optimization, in this paper, we proposed a proper weighting scheme utilizing a novel k-strength relationship which naturally represents the coupling distance between two nodes. Community structure detection using a generalized weighted modularity measure is refined based on the weighted k-strength matrix. We apply our algorithm on both the famous benchmark network and the real networks. Theoretical analysis and experiments show that the weighted algorithm can uncover communities fast and accurately and can be easily extended to large-scale real networks.
Similar content being viewed by others
References
M E J Newman, Phys. Rev. E 69, 066133 (2004)
M E J Newman and M Girvan, Phys. Rev. E 69, 026113 (2004)
H J Li, Y Wang, L Y Wu, Z P Liu, L Chen and X S Zhang, Eur. Phys. Lett. 86(1), 012801 (2012)
M Girvan and M E J Newman, Proc. Natl Acad. Sci. 99, 7821 (2002)
X S Zhang, R S Wang, Y Wang, J Wang, Y Qiu, L Wang and L Chen, Eur. Phys. Lett. 87, 38002 (2009)
X S Zhang, Z Li, R S Wang and Y Wang, J. Comb. Optim. 23(4), 425 (2012)
L C Huang, T J Yen and S C T Chou, International Conference on Advances in Social Networks Analysis and Mining, IEEE Computer Society, pp. 110–117 (2011)
Peter J Mucha et al, Science 328, 876 (2010)
R Guimera and L A N Amaral, Nature 433, 895 (2005)
B W Kernighan and S Lin, Bell System Tech. J. 49, 291 (1970)
H J Li and X S Zhang, Eur. Phys. Lett. 103, 58002 (2013)
H J Li, Y Wang, L Y Wu, J Zhang and X S Zhang, Phys. Rev. E 86, 016109 (2012)
F Radicchi, C Castellano and F Cecconi, Proc. Natl Acad. Sci. 101, 2658 (2004)
V D Blondel, J L Guillaume, R Lambiotte and E Lefebvre, J. Stat. Mech. 10, 10008 (2005)
B H Good, Y-A de Montjoye and A Clauset, Phys. Rev. E 81, 046106 (2010)
A Arenas, A Fernandez and S Gomez, New J. Phys. 10(5), 053039 (2008)
M Latapy and P Pons, Proceedings of the 20th International Symposium on Computer and Information Sciences, Lect. Notes Comput. Sci., 3733, 284 (2005)
N Guttmann-Beck and Hassin, Algorithmica 27, 198 (2000)
H W Su, Int. Rev. Comput. Software 7(7), 3782 (2012)
M R Garey and D S Jonson, Computers and intractability: A guide to the theory of NP-completeness (Freeman, San Francisco, CA, 1979)
H J Li, H Wang and L Chen, Eur. Phys. Lett. 108(6), 68009 (2015)
M Rosvall and C T Bergstrom, Proc. Natl Acad. Sci. 105(4), 1118 (2008)
W Zachary, J. Anthropol. Res. 33, 452 (1977)
A Clauset, M E J Newman and C Moore, Phys. Rev. E 70(6), 066111 (2004)
J Duch and A Arenas, Phys. Rev. E 72(2), 027104 (2005)
S Boccaletti, M Ivanchenko, V Latora and A Pluchino, Phys. Rev. E 75(4), 045102 (2007)
P Ronhovde and Z Nussinov, Phys. Rev. E 81(4), 046114 (2010)
L Danon, J Duch, D Guilera and A Arenas, J. Stat. Mech. 29, 09008 (2005)
H J Li and J Daniels, Phys. Rev. E 91(1), 012801 (2015)
Z P Li, S H Zhang, R S Wang, X S Zhang and L Chen, Phys. Rev. E 77, 036109 (2008)
A Lancichinetti and S Fortunato, Phys. Rev. E 80, 056117 (2009)
G Agarwal and D Kempe, Eur. Phys. J. B 66(3), 409 (2008)
D E Knuth, The Stanford GraphBase: A platform for combinatorial computing (Addison Wesley Professional, Reading, CA, 1993) Vol. 37, p. 592
P Gleiser and L Danon, Adv. Complex Syst. 6, 565 (2003)
M Boguna, R Pastor-Satorras, A Diaz-Guilera and A Arenas, Phys. Rev. E 70(5), 056122 (2004)
D Lusseau, K Schneider, O J Boisseau, P Haase, E Slooten and S M Dawson, Behav. Ecol. Sociobiol. 54(4), 396 (2003)
Acknowledgements
The authors are grateful for the detailed reviews and constructive comments of the reviewers, which have greatly improved the quality of this paper. The research was supported in part by MOE (Ministry of Education in China), Liberal Arts and Social Sciences Foundation Grant No. 12YJA870013, NSFC grants 71561025, 71401194, 91324203 and Ph.D. research foundation of Xinjiang University of Finance and Economics Grant No. 2015BS004.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
MIN, D., YU, K. & LI, HJ. Refinement of the community detection performance by weighted relationship coupling. Pramana - J Phys 88, 44 (2017). https://doi.org/10.1007/s12043-016-1343-2
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s12043-016-1343-2