A Label Propagation-Based Algorithm for Community Discovery in Online Social Networks

  • Yitong Wang
  • Yurong Zhao
  • Zhuoxiang Zhao
  • Zhicheng Liao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8346)


With the rapid development of Internet and Web 2.0 applications, many different patterns of online social networks become fashionable all over the world. These sites help people share and exchange information, as well as maintain their social relations on the Internet. Therefore, it is very important to study the structure of communities in online social network.

Most of existed community discovery algorithms are very costly. Moreover, the behavior of users in online social networks is rather dynamic. We first investigate Label Propagation Algorithm (LPA), which has near linear time complexity and discuss some limitations of LPA. Then, we propose a new algorithm for community discovery based on label influence vector (LIVB), an improved variation of LPA. In this algorithm, we abstract several types of nodes corresponding to different kinds of entities such as users, posts, videos as well as comments. Different types of relations between nodes are also taken into account. A node will update its label by calculating its label influence vector. We conduct experiments on crawled real data and the experimental results show that communities discovered by LIVB algorithm have more concentrative topics. The quality of the communities is improved and LIVB algorithm remains a near linear time complexity.


Community discovery label propagation social network label influence value label influence vector 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Newman, M.E.J.: The Structure and Function of Complex Networks. SIAM Review 45(2), 167–256 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Albert, R., Barabsi, A.L.: Statistical Mechanics of Complex Networks. Reviews of Modern Physics 74(1), 47 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Fortunato, S.: Community Detection in Graphs. Physics Reports 486(3), 75–174 (2010)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Alba, R.D.: A Graph–Theoretic Definition of a Sociometric Cique. Journal of Mathematical Sociology 3(1), 113–126 (1973)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Girvan, M., Newman, M.E.J.: Community Structure in Social and Biological Networks. Proceedings of the National Academy of Sciences 99(12), 7821–7826 (2002)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Yang, B., Cheung, W.K., Liu, J.: Community Mining from Signed Social Networks. IEEE Transactions on Knowledge and Data Engineering 19(10), 1333–1348 (2007)CrossRefGoogle Scholar
  7. 7.
    Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Yolum, p., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 284–293. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Kim, D.H., Jeong, H.: Systematic Analysis of Group Identification in Stock Markets. Physical Review E 72(4), 46133 (2005)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Fiedler, M.: Algebraic Connectivity of Graphs. Czechoslovak Mathematical Journal 23(2), 298–305 (1973)MathSciNetGoogle Scholar
  10. 10.
    Shi, J., Malik, J.: Normalized Cuts and Image Segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22(8), 888–905 (2000)CrossRefGoogle Scholar
  11. 11.
    Kernighan, B.W., Lin, S.: An Efficient Heuristic Procedure for Partitioning Graphs. Bell System Technical 49(1), 291–307 (1970)CrossRefzbMATHGoogle Scholar
  12. 12.
    Danon, L., Daz-Guilera, A., Arenas, A.: The Effect of Size Heterogeneity on Community Identification in Complex Networks. Journal of Statistical Mechanics: Theory and Experiment 2006(11), P11010 (2006)Google Scholar
  13. 13.
    Burt, R.S.: Positions in Networks. Social Forces 55(1), 93–122 (1976)MathSciNetGoogle Scholar
  14. 14.
    Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications. Cambridge University Press (1994)Google Scholar
  15. 15.
    Radicchi, F., Castellano, C., Cecconi, F., et al.: Defining and Identifying Communities in Networks. Proceedings of the National Academy of Sciences of the United States of America 101(9), 2658–2663 (2004)CrossRefGoogle Scholar
  16. 16.
    Kleinberg, J.M.: Authoritative Sources in a Hyperlinked Environment. Journal of the ACM (JACM) 46(5), 604–632 (1999)CrossRefzbMATHMathSciNetGoogle Scholar
  17. 17.
    Pirolli, P., Pitkow, J., Rao, R.: Silk from a Sow’s Ear: Extracting Usable Structures from the Web. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems: Common Ground, pp. 118–125. ACM (1996)Google Scholar
  18. 18.
    Raghavan, U.N., Albert, R., Kumara, S.: Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks. Physical Review E 76(3), 036106 (2007)Google Scholar
  19. 19.
    Leung, I.X.Y., Hui, P., Li, P., et al.: Towards real-time community detection in large networks. Physical Review E 79(6), 066107 (2009)Google Scholar
  20. 20.
    Tibly, G., Kertsz, J.: On the Equivalence of the Label Propagation Method of Community Detection and a Potts Model Approach. Physica A: Statistical Mechanics and its Applications 387(19), 4982–4984 (2008)CrossRefGoogle Scholar
  21. 21.
    Newman, M.E.J., Girvan, M.: Finding and Evaluating Community Structure in Networks. Physical Review E 69(2), 026113 (2004)Google Scholar
  22. 22.
    Wang, Y., Feng, X.: A Potential-Based Node Selection Strategy for Influence Maximization in a Social Network. In: Huang, R., Yang, Q., Pei, J., Gama, J., Meng, X., Li, X. (eds.) ADMA 2009. LNCS, vol. 5678, pp. 350–361. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  23. 23.
    Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (TKDD) 1(1), 2 (2007)CrossRefGoogle Scholar
  24. 24.
    De Choudhury, A., et al.: Social Synchrony: Predicting Mimicry of User Actions in Online Social Media. In: International Conference on Computational Science and Engineering 2009, CSE 2009, pp. 151–158. IEEE CPS, Vancouver (2009)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yitong Wang
    • 1
  • Yurong Zhao
    • 1
  • Zhuoxiang Zhao
    • 1
  • Zhicheng Liao
    • 1
  1. 1.School of Computer ScienceFudan UniversityShanghaiChina

Personalised recommendations