Overlapping Community Detection in Weighted Graphs: Matrix Factorization Approach

  • Konstantin Slavnov
  • Maxim PanovEmail author
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 794)


This work investigates the overlapping community detection problem. Recently, some efficient matrix factorization algorithms were proposed which can detect overlapping communities in unweighted graphs with millions of nodes. We expand these approaches to weighted graphs and develop a novel probabilistic model of overlapping community structure in weighted graphs. The resulting algorithm boils down to generalized matrix factorization with non-quadratic loss function. The comparison with the other methods shows that the proposed algorithm outperforms modern analogues.


Overlapping community detection Social graphs Matrix factorization 



The reported study was funded by RFBR according to the research project 18-37-00489.


  1. 1.
    Airoldi, E.M., Blei, D.M., Fienberg, S.E., Xing, E.P.: Mixed membership stochastic blockmodels. J. Mach. Learn. Res. 9(Sep), 1981–2014 (2008). Scholar
  2. 2.
    Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X.: Group formation in large social networks: membership, growth, and evolution. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 44–54. ACM (2006).
  3. 3.
    Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004). Scholar
  4. 4.
    Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010). Scholar
  5. 5.
    Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002). Scholar
  6. 6.
    Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010). Scholar
  7. 7.
    Krogan, N.J., et al.: Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature 440(7084), 637–643 (2006). Scholar
  8. 8.
    Lancichinetti, A., Fortunato, S.: Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Phys. Rev. E 80(1), 016118 (2009). Scholar
  9. 9.
    Lancichinetti, A., Fortunato, S., Kertész, J.: Detecting the overlapping and hierarchical community structure in complex networks. New J. Phys. 11(3), 033015 (2009). Scholar
  10. 10.
    Lu, Z., Sun, X., Wen, Y., Cao, G., La Porta, T.: Algorithms and applications for community detection in weighted networks. IEEE Trans. Parallel Distrib. Syst. 26(11), 2916–2926 (2015). Scholar
  11. 11.
    Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814–818 (2005). Scholar
  12. 12.
    Pons, P., Latapy, M.: Computing communities in large networks using random walks. In: Yolum, I., Güngör, T., Gürgen, F., Özturan, C. (eds.) ISCIS 2005. LNCS, vol. 3733, pp. 284–293. Springer, Heidelberg (2005). Scholar
  13. 13.
    Xie, J., Kelley, S., Szymanski, B.K.: Overlapping community detection in networks: the state-of-the-art and comparative study. ACM Comput. Surv. (CSUR) 45(4), 43 (2013). Scholar
  14. 14.
    Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 587–596. ACM (2013).

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Skolkovo Institute of Science and Technology (Skoltech)MoscowRussia
  2. 2.Higher School of EconomicsMoscowRussia

Personalised recommendations