Abstract
Directed networks appear in an expanding array of applications, for example, the world wide web, social networks, transaction networks, and citation networks. A critical task in analyzing directed networks is clustering, where the goal is partitioning the network's nodes based on their similarities while accounting for the direction of relationships between nodes. Non-negative matrix factorization (NMF) and its variations have been used to cluster the nodes in directed networks by approximating their adjacency matrices efficaciously. The differences between the corresponding entries of the actual and approximate adjacency matrices are considered as errors, which are assumed to follow Gaussian distributions. However, these errors could deviate from Gaussian distributions in various real-world networks. In this work, we propose a robust asymmetric non-negative matrix factorization method to cluster the nodes in directed networks. Recognizing that the errors do not follow Gaussian distributions in real-world networks, the proposed method assumes that the errors follow a Cauchy distribution, which resembles the Gaussian distribution but has heavier tails. Experiments using real-world as well as artificial networks show that the proposed method outperforms existing NMF methods and other representative work in clustering in various settings.





Similar content being viewed by others
References
Aggarwal, C. C., & Reddy, C. K. (2014). Data clustering: Algorithms and applications. https://www.taylorfrancis.com/books/9781315373515
Akbar, Z., Liu, J., & Latif, Z. (2021). Mining social applications network from business perspective using modularity maximization for community detection. Social Network Analysis and Mining, 11(1), 115. https://doi.org/10.1007/s13278-021-00798-0
Bedi, P., & Sharma, C. (2016). Community detection in social networks. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, 6(3), 115–135.
Blondel, V. D., Guillaume, J.-L., Lambiotte, R., & Lefebvre, E. (2008). Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment, 2008(10), P10008. https://doi.org/10.1088/1742-5468/2008/10/P10008
Boutsidis, C., & Gallopoulos, E. (2008). SVD based initialization: A head start for nonnegative matrix factorization. Pattern Recognition, 41(4), 1350–1362. https://doi.org/10.1016/j.patcog.2007.09.010
Clarkson, K. L., Drineas, P., Magdon-Ismail, M., Mahoney, M. W., Meng, X., & Woodruff, D. P. (2016). The fast Cauchy transform and faster robust linear regression. SIAM Journal on Computing, 45(3), 763–810. https://doi.org/10.1137/140963698
Everett, M., & Borgatti, S. (1998). Analyzing Clique Overlap. Connections, 21, 49–61.
Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3–5), 75–174. https://doi.org/10.1016/j.physrep.2009.11.002
Foster, J. G., Foster, D. V., Grassberger, P., & Paczuski, M. (2010). Edge direction and the structure of networks. Proceedings of the National Academy of Sciences, 107(24), 10815–10820. https://doi.org/10.1073/pnas.0912671107
Gligorijević, V., Panagakis, Y., & Zafeiriou, S. (2018). Non-negative matrix factorizations for multiplex network analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence, 41(4), 928–940.
Guan, N., Tao, D., Luo, Z., & Yuan, Bo. (2011). Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent. IEEE Transactions on Image Processing, 20(7), 2030–2048. https://doi.org/10.1109/TIP.2011.2105496
Hass, G., Simon, P., & Kashef, R. (2020). Business applications for current developments in big data clustering: an overview. IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2020, 195–199. https://doi.org/10.1109/IEEM45057.2020.9309941
Hespanha, J. P. (2004). An efficient matlab algorithm for graph partitioning (pp. 1–8). University of California.
Holland, P. W., Laskey, K. B., & Leinhardt, S. (1983). Stochastic blockmodels: First steps. Social Networks, 5(2), 109–137. https://doi.org/10.1016/0378-8733(83)90021-7
Kim, J., & Park, H. (2008). Sparse nonnegative matrix factorization for clustering. Georgia Institute of Technology.
Kim, Y., Son, S.-W., & Jeong, H. (2010). Finding communities in directed networks. Physical Review E, 81(1), 016103. https://doi.org/10.1103/PhysRevE.81.016103
Labatut, V., & Balasque, J.-M. (2013). Informative value of individual and relational data compared through business-oriented community detection. In The influence of technology on social network analysis and mining (pp. 303–330). Springer.
Lancichinetti, A., & Fortunato, S. (2009). Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities. Physical Review E, 80(1), 016118. https://doi.org/10.1103/PhysRevE.80.016118
Lee, D. D., & Seung, H. S. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401(6755), 788–791.
Leicht, E. A., & Newman, M. E. J. (2008). Community structure in directed networks. Physical Review Letters, 100(11), 118703. https://doi.org/10.1103/PhysRevLett.100.118703
Li, M., Pan, S., Zhang, Y., & Cai, X. (2016). Classifying networked text data with positive and unlabeled examples. Pattern Recognition Letters, 77, 1–7. https://doi.org/10.1016/j.patrec.2016.03.006
Li, X., Lu, Q., Dong, Y., & Tao, D. (2019). Robust subspace clustering by cauchy loss function. IEEE Transactions on Neural Networks and Learning Systems, 30(7), 2067–2078. https://doi.org/10.1109/TNNLS.2018.2876327
Malliaros, F. D., & Vazirgiannis, M. (2013). Clustering and community detection in directed networks: A survey. Physics Reports, 533(4), 95–142. https://doi.org/10.1016/j.physrep.2013.08.002
Mirkin, B. (1996). Mathematical classification and clustering (Vol. 11). Springer. https://doi.org/10.1007/978-1-4613-0457-9
Mirzal, A. (2020). Statistical analysis of clustering performances of NMF, spectral clustering, and K-means. In 2020 2nd international conference on computer and information sciences (ICCIS) (pp. 1–4). https://doi.org/10.1109/ICCIS49240.2020.9257641
Nascimento, M. C. V., & de Carvalho, A. C. P. L. F. (2011). Spectral methods for graph clustering—A survey. European Journal of Operational Research, 211(2), 221–231. https://doi.org/10.1016/j.ejor.2010.08.012
Newman, M. E. (2006). Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23), 8577–8582.
Newman, M. (2018). Networks. Oxford University Press.
Newman, M. E. J., & Leicht, E. A. (2007). Mixture models and exploratory analysis in networks. Proceedings of the National Academy of Sciences, 104(23), 9564–9569. https://doi.org/10.1073/pnas.0610537104
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On Spectral Clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems, 14.
Pan, W., Chen, S., & Feng, Z. (2013). Automatic clustering of social tag using community detection. Applied Mathematics & Information Sciences, 7(2), 675–681.
Reichardt, J., & White, D. R. (2007). Role models for complex networks. The European Physical Journal B, 60(2), 217–224. https://doi.org/10.1140/epjb/e2007-00340-y
Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888–905.
Shiga, M., & Mamitsuka, H. (2015). Non-negative matrix factorization with auxiliary information on overlapping groups. IEEE Transactions on Knowledge and Data Engineering, 27(6), 1615–1628. https://doi.org/10.1109/TKDE.2014.2373361
Sibuya, M. (1993). A random clustering process. Annals of the Institute of Statistical Mathematics, 45(3), 459–465. https://doi.org/10.1007/BF00773348
Tosyali, A., Choi, J., Kim, B., Lee, H., & Jeong, M. K. (2021). A dynamic graph-based approach to ranking firms for identifying key players using inter-firm transactions. Annals of Operations Research, 303(1–2), 5–27. https://doi.org/10.1007/s10479-021-04100-5
Tosyali, A., Kim, J., Choi, J., & Jeong, M. K. (2019). Regularized asymmetric nonnegative matrix factorization for clustering in directed networks. Pattern Recognition Letters, 125, 750–757. https://doi.org/10.1016/j.patrec.2019.07.005
Tosyali, A., Kim, J., Choi, J., Kang, Y., & Jeong, M. K. (2020). New node anomaly detection algorithm based on nonnegative matrix factorization for directed citation networks. Annals of Operations Research, 288(1), 457–474. https://doi.org/10.1007/s10479-019-03508-4
van den Heuvel, M., Mandl, R., & Hulshoff Pol, H. (2008). Normalized cut group clustering of resting-state fMRI data. PLoS ONE, 3(4), e2001. https://doi.org/10.1371/journal.pone.0002001
Van Lierde, H., Chow, T. W. S., & Chen, G. (2020). Scalable spectral clustering for overlapping community detection in large-scale networks. IEEE Transactions on Knowledge and Data Engineering, 32(4), 754–767. https://doi.org/10.1109/TKDE.2019.2892096
Vavasis, S. A. (2010). On the complexity of nonnegative matrix factorization. SIAM Journal on Optimization, 20(3), 1364–1377. https://doi.org/10.1137/070709967
Wang, D., Li, J., Xu, K., & Wu, Y. (2017). Sentiment community detection: Exploring sentiments and relationships in social networks. Electronic Commerce Research, 17(1), 103–132.
Wang, F., Li, T., Wang, X., Zhu, S., & Ding, C. (2011). Community discovery using nonnegative matrix factorization. Data Mining and Knowledge Discovery, 22(3), 493–521.
Ward, J. H. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58(301), 236–244. https://doi.org/10.1080/01621459.1963.10500845
White, S., & Smyth, P. (2005). A spectral clustering approach to finding communities in graphs. In Proceedings of the 2005 SIAM international conference on data mining (pp. 274–285).
Younis, O., Krunz, M., & Ramasubramanian, S. (2006). Node clustering in wireless sensor networks: Recent developments and deployment challenges. IEEE Network, 20(3), 20–25.
Zheng, Y., Hu, R., Fung, S., Yu, C., Long, G., Guo, T., & Pan, S. (2020). Clustering social audiences in business information networks. Pattern Recognition, 100, 107126. https://doi.org/10.1016/j.patcog.2019.107126
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
To show that updating rules (5) and (6) are correct, the Lagrangian objective function is:
Note that \(\frac{1}{{\parallel {{\varvec{a}}}_{i}- {\left(\mathbf{W}\mathbf{H}{\mathbf{W}}^{{\text{T}}}\right)}_{i}\parallel }^{2}+{\gamma }^{2}}\) is outside the derivative, so it will be treated as constant.
Complementary slackness means that \({{[{\varvec{\upbeta}}}_{1}]}_{ik}[{\mathbf{W}]}_{ik}=0\) and \({{[{\varvec{\upbeta}}}_{2}]}_{kj}{[\mathbf{H}]}_{kj}=0\).
Thus, if \(\mathbf{W}\) and \(\mathbf{H}\) satisfy the KKT conditions, updated \(\mathbf{W}\) and \(\mathbf{H}\) using Eqs. (5) and (6) also satisfy the KKT conditions.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Yu, Y., Baek, J., Tosyali, A. et al. Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks. Ann Oper Res 341, 245–265 (2024). https://doi.org/10.1007/s10479-024-05868-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-024-05868-y