A Novel Approach for Community Detection Using the Label Propagation Technique

  • Jyoti ShokeenEmail author
  • Chhavi Rana
  • Harkesh Sehrawat
Part of the Studies in Computational Intelligence book series (SCI, volume 771)


In this chapter, we propose a new label propagation-based approach to detect community structure in social networks. This is a multiple label propagation technique in which a node can obtain labels of different communities, which allows researchers to discover overlapping communities. One important advantage of this approach is the updating of node labels over time that makes it dynamic. Given an underlying social network, we assume that each node receives a unique label id similar to its node id in the initial phase. We allow each node to accept multiple labels from its neighbors if each of the neighbors has a high common neighbor score, which naturally encompasses the idea of overlapping communities.



The first author wishes to say thanks to the Council of Scientific and Industrial Research (CSIR) for financial assistance received in the form of JRF.


  1. 1.
    Breiger, R.L. 2004. The analysis of social networks. In Handbook of Data Analysis, ed. M. Hardy, and A. Bryman, 505–526. London: SAGE Publications.Google Scholar
  2. 2.
    Gregory, S. 2010. Finding overlapping communities in networks by label propagation. New Journal of Physics 12 (10): 103018.CrossRefGoogle Scholar
  3. 3.
    Havvaei, E., and N. Deo. 2016. A game-theoretic approach for detection of overlapping communities in dynamic complex networks. 1: 113–324. arXiv:1603.00509.
  4. 4.
    Hu, W. 2013. Finding statistically significant communities in networks with weighted label propagation. Social Network 2: 138–146.CrossRefGoogle Scholar
  5. 5.
    Lancichinetti, A., and S. Fortunato. 2010. Community detection algorithms: A comparative analysis. Physical Review E 80 (5): 056117. Scholar
  6. 6.
    Newman, M.E., and G. Reinert. 2016. Estimating the number of communities in a network. Physical Review Letters 117–125.Google Scholar
  7. 7.
    Newman, M.E., and M. Girvan. 2004. Finding and evaluating community structure in networks. Physical Review E 69 (2): 026113.CrossRefGoogle Scholar
  8. 8.
    Pizzuti, C. 2009. Overlapped community detection in complex networks. In Proceedings of the 11th Annual Conference On Genetic And Evolutionary Computation, 859–866, ACM.Google Scholar
  9. 9.
    Raghavan, U.N., R. Albert, and S. Kumara. 2007. Near linear time algorithm to detect community structures in large-scale networks. Physical Review E 76: 36106.CrossRefGoogle Scholar
  10. 10.
    Steinhaeuser, K., and N.V. Chawla. 2008. Community detection in a large real-world social network. Social Computing, Behaviora-Cultural Modeling Prediction, 168–175. Berlin: Springer.CrossRefGoogle Scholar
  11. 11.
    Wu, Z.H., Y.F. Lin, S. Gregory, H.Y. Wan, and S.F. Tian. 2012. Balanced multi-label propagation for overlapping community detection in social networks. Journal of Computer Science Technology 27: 468–479.MathSciNetCrossRefGoogle Scholar
  12. 12.
    Xie, J., and B.K. Szymanski. 2012. Towards linear time overlapping community detection in social networks. In Advanced Techniques in Knowledge Discovery Data Mining, ed. P.-N. Tan, S. Chawla, C.K. Ho, and J. Bailey, 25–36. Berlin: Springer.CrossRefGoogle Scholar
  13. 13.
    Yao, L., L. Wang, L. Pan, and K. Yao. 2016. Link prediction based on common-neighbors for dynamic social network. Procedia Computer Science 83: 82–89.CrossRefGoogle Scholar
  14. 14.
    Zhou, L., K. Lu, P. Yang, L. Wang, and B. Kong. 2015. An approach for overlapping and hierarchical community detection in social networks based on coalition formation game theory. Expert Systems with Applications 42: 9634–9646.CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2019

Authors and Affiliations

  1. 1.University Institute of Engineering and TechnologyRohtakIndia

Personalised recommendations