Overlapping Community Detection in Weighted Graphs: Matrix Factorization Approach
Conference paper
First Online:
Abstract
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.
Keywords
Overlapping community detection Social graphs Matrix factorizationNotes
Acknowledgments
The reported study was funded by RFBR according to the research project 18-37-00489.
References
- 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). http://www.arxiv.org/abs/0709.2938zbMATHGoogle Scholar
- 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). https://doi.org/10.1145/1150402.1150412
- 3.Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004). https://doi.org/10.1017/cbo9780511804441CrossRefzbMATHGoogle Scholar
- 4.Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3), 75–174 (2010). https://doi.org/10.1016/j.physrep.2009.11.002MathSciNetCrossRefGoogle Scholar
- 5.Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proc. Natl. Acad. Sci. 99(12), 7821–7826 (2002). http://www.arxiv.org/pdf/cond-mat/0112110.pdfMathSciNetCrossRefGoogle Scholar
- 6.Gregory, S.: Finding overlapping communities in networks by label propagation. New J. Phys. 12(10), 103018 (2010). https://doi.org/10.1088/1367-2630/12/10/103018CrossRefGoogle Scholar
- 7.Krogan, N.J., et al.: Global landscape of protein complexes in the yeast saccharomyces cerevisiae. Nature 440(7084), 637–643 (2006). http://www.nature.com/nature/journal/v440/n7084/full/nature04670.htmlCrossRefGoogle Scholar
- 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). https://doi.org/10.1103/physreve.80.016118CrossRefGoogle Scholar
- 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). https://arxiv.org/abs/0802.1218CrossRefGoogle Scholar
- 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). https://doi.org/10.1109/tpds.2014.2370031CrossRefGoogle Scholar
- 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). https://doi.org/10.1038/nature03607CrossRefGoogle Scholar
- 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). https://doi.org/10.1007/11569596_31CrossRefGoogle Scholar
- 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). https://doi.org/10.1145/2501654.2501657CrossRefzbMATHGoogle Scholar
- 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). https://doi.org/10.1145/2433396.2433471
Copyright information
© Springer Nature Switzerland AG 2019