Abstract
Community detection is one of the most important and challenging problems in graph mining and social network analysis. Nonnegative Matrix Factorization (NMF) based methods have been proved to be effective in the task of community detection. However, real-world networks could be noisy and existing NMF based community detection methods are sensitive to the outliers and noise due to the utilization of the squared loss function to measure the quality of graph regularization and network reconstruction. In this paper, we propose a framework based on the nonnegative residual matrix factorization (NRMF) to overcome this limitation. In this method, a residual matrix, represented by the matrix reconstruction error, is explicitly introduced to capture the impact of outliers and noise. The residual matrix should be sparse intuitively so some sparse regularization can be used to model the sparsity. Specifically, three different types of sparse regularization, i.e., \(L_0\), \(L_{1}\) and \(L_{2,1}\), have been studied. Multiplicative update rules and different thresholding operators are used to learn these lower-rank matrices. Extensive experiments on benchmark networks with and without known communities demonstrate that our framework is more robust so that it outperforms state-of-the-art NMF based approaches in community detection task.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
These datasets are from http://www-personal.umich.edu/~mejn/netdata/, http://snap.stanford.edu/data/index.html and https://linqs.soe.ucsc.edu/data.
References
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)
Cai, D., He, X., Han, J., Huang, T.S.: Graph regularized nonnegative matrix factorization for data representation. IEEE Trans. Pattern Anal. Mach. Intell. 33(8), 1548–1560 (2010)
Cavallari, S., Zheng, V.W., Cai, H., Chang, K.C.C., Cambria, E.: Learning community embedding with community detection and node embedding on graphs. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 377–386 (2017)
Ding, C., Li, T., Peng, W. and Park, H.: Orthogonal nonnegative matrix t-factorizations for clustering. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 126–135. ACM (2006)
Dorogovtsev, S.N., Goltsev, A.V., Mendes, J.F.F.: K-core organization of complex networks. Phys. Rev. Lett. 96(4), 040601 (2006)
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Huang, S., Wang, H., Li, T., Li, T., Zenglin, X.: Robust graph regularized nonnegative matrix factorization for clustering. Data Min. Knowl. Disc. 32(2), 483–503 (2018). https://doi.org/10.1007/s10618-017-0543-9
Kamuhanda, D., He, K.: A nonnegative matrix factorization approach for multiple local community detection. In: 2018 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), pp. 642–649. IEEE (2018)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359–392 (1998)
Laurberg, H., Christensen, M.G., Plumbley, M.D., Hansen, L.K., Jensen, S.H.: Theorems on positive data: on the uniqueness of NMF. Comput. Intell. Neurosci. 2008, (2008)
Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, pp. 556–562 (2001)
Ma, X., Dong, D., Wang, Q.: Community detection in multi-layer networks using joint nonnegative matrix factorization. IEEE Trans. Knowl. Data Eng. 31(2), 273–286 (2018)
Newman, M.E.J.: Modularity and community structure in networks. Proc. Int. Acad. Sci. 103(23), 8577–8582 (2006)
Nie, F., Huang, H., Cai, X. and Ding, C.H.: Efficient and robust feature selection via joint \(\ell \)2, 1-norms minimization. In: Advances in neural information processing systems, pp. 1813–1821 (2010)
Pei, Y., Chakraborty, N., Sycara, K.: Nonnegative matrix tri-factorization with graph regularization for community detection in social networks. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)
Pei, Y., Du, X., Fletcher, G., Pechenizkiy, M.: Dynamic network representation learning via gaussian embedding. In: NeurIPS 2019 Workshop on Graph Representation Learning (2019)
Pei, Y., Fletcher, G., Pechenizkiy, M.: Joint role and community detection in networks via l 2, 1 norm regularized nonnegative matrix tri-factorization. In: Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp. 168–175 (2019)
Peng, C., Kang, Z., Yunhong, H., Cheng, J., Cheng, Q.: Robust graph regularized nonnegative matrix factorization for clustering. ACM Trans. Knowl. Discov. Data (TKDD) 11(3), 33 (2017)
Psorakis, I., Roberts, S., Ebden, M., Sheldon, B.: Overlapping community detection using Bayesian non-negative matrix factorization. Phys. Rev. E 83(6), 066114 (2011)
Schmidt, M.N., Winther, O., Hansen, L.K.: Bayesian non-negative matrix factorization. In: Adali, T., Jutten, C., Romano, J.M.T., Barros, A.K. (eds.) ICA 2009. LNCS, vol. 5441, pp. 540–547. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-00599-2_68
Sun, B.J., Shen, H., Gao, J., Ouyang, W. and Cheng, X.: A non-negative symmetric encoder-decoder approach for community detection. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pp. 597–606 (2017)
Wang, F., Li, T., Wang, X., Zhu, S., Ding, C.: Community discovery using nonnegative matrix factorization. Data Min. Knowl. Discov. 22(3), 493–521 (2011)
Wang, X., Cui, P., Wang, J., Pei, J., Zhu, W., Yang, S.: Community preserving network embedding. In: Thirty-first AAAI Conference on Artificial Intelligence (2017)
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)
Yang, L.: Autonomous semantic community detection via adaptively weighted low-rank approximation. ACM Trans. Multimedia Comput. Commun. Appl. (TOMM) 15(3s), 1–22 (2019)
Ye, F., Chen, C., Zheng, Z.: Deep autoencoder-like nonnegative matrix factorization for community detection. In: Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pp. 1393–1402 (2018)
Yuan, Z., Oja, E.: Projective nonnegative matrix factorization for image compression and feature extraction. In: Kalviainen, H., Parkkinen, J., Kaarna, A. (eds.) SCIA 2005. LNCS, vol. 3540, pp. 333–342. Springer, Heidelberg (2005). https://doi.org/10.1007/11499145_35
Zhang, Y., Yeung, D.Y.: Overlapping community detection via bounded nonnegative matrix tri-factorization. In: Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 606–614. ACM (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Pei, Y., Liu, C., Zheng, C., Cheng, L. (2020). Nonnegative Residual Matrix Factorization for Community Detection. In: Huang, Z., Beek, W., Wang, H., Zhou, R., Zhang, Y. (eds) Web Information Systems Engineering – WISE 2020. WISE 2020. Lecture Notes in Computer Science(), vol 12342. Springer, Cham. https://doi.org/10.1007/978-3-030-62005-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-62005-9_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-62004-2
Online ISBN: 978-3-030-62005-9
eBook Packages: Computer ScienceComputer Science (R0)