{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/asymmetric-semi-nonnegative-matrix","title":"Asymmetric Semi-Nonnegative Matrix Factorization for Directed Graph Clustering","arxiv_id":null,"date":"2020-12-31","proceeding":null,"authors":["Reyhaneh Abdollahi; Seyed Amjad Seyedi; Mohamad Reza Noorimehr"],"abstract":"Graph clustering is a fundamental task in the network analysis, which is essential for many modern applications. In recent years, Nonnegative Matrix Factorization (NMF) has been effectively used to discover cluster structures due to its powerful interpretability property. In this paper, we introduce a clustering algorithm based on Semi-Nonnegative Matrix Factorization that is one of the well-known extensions of NMF. This factorization allows algorithms to capture more accurate (positive and negative) relationships among clusters and, thereby, to derive a latent factor that is even proper for clustering and also has much more responsibility in the regularization. Moreover, to improve the clustering, we define an asymmetric graph regularization to penalize the asymmetric similarity of nodes denoted by cluster memberships. Experimental results on four real-world datasets validate the effectiveness of the proposed method.","url_abs":"https://ieeexplore.ieee.org/abstract/document/9303649","url_pdf":"https://doi.org/10.1109/ICCKE50421.2020.9303649","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"asymmetric-semi-nonnegative-matrix","repo_url":"https://github.com/amjadseyedi/RAsNMF","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"graph-clustering","task_name":"Graph Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}