Contrastive Deep Nonnegative Matrix Factorization for Community Detection
Not on the map. Why?
Abstract (arXiv)
Recently, nonnegative matrix factorization (NMF) has been widely adopted for community detection, because of its better interpretability. However, the existing NMF-based methods have the following three problems: 1) they directly transform the original network into community membership space, so it is difficult for them to capture the hierarchical information; 2) they often only pay attention to the topology of the network and ignore its node attributes; 3) it is hard for them to learn the global structure information necessary for community detection. Therefore, we propose a new community detection algorithm, named Contrastive Deep Nonnegative Matrix Factorization (CDNMF). Firstly, we deepen NMF to strengthen its capacity for information extraction. Subsequently, inspired by contrastive learning, our algorithm creatively constructs network topology and node attributes as two contrasting views. Furthermore, we utilize a debiased negative sampling layer and learn node similarity at the community level, thereby enhancing the suitability of our model for community detection. We conduct experiments on three public real graph datasets and the proposed model has achieved better results than state-of-the-art methods. Code available at https://github.com/6lyc/CDNMF.git.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 8 of its 30 references that are in the map. First posted on arXiv 4 Nov 2023.
Builds on
8 of 30 references.
References · 8
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2015LINE: Large-scale Information Network Embeddingcited by 582
- 2020Deep Learning for Community Detection: Progress, Challenges and Opportunitiescited by 42
- 2022VGAER: Graph Neural Network Reconstruction based Community Detectioncited by 14
- 2022Reformulating Speaker Diarization as Community Detection With Emphasis On Topological Structurecited by 3
- 2013Structural and Functional Discovery in Dynamic Networks with Non-negative Matrix Factorizationcited by 2
- 2014On the Permanence of Vertices in Network Communitiescited by 2
- 2023Community Detection Graph Convolutional Network for Overlap-Aware Speaker Diarizationcited by 2
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 1.
4 papers.
- 2025Deep Cut-informed Graph Embedding and Clusteringcited by 7
- 2026RecGOAT: Graph Optimal Adaptive Transport for LLM-Enhanced Multimodal Recommendation with Dual Semantic Alignmentcited by 4
- 2023CueGCL: Cluster-aware Personalized Self-Training for Unsupervised Graph Contrastive Learningcited by 1
- 2025Hybrid Graph Embeddings and Louvain Algorithm for Unsupervised Community Detectioncited by 1
- 2026RecGOAT: Graph Optimal Adaptive Transport for LLM-Enhanced Multimodal Recommendation with Dual Semantic Alignment31 Jan 2026
- 2025Hybrid Graph Embeddings and Louvain Algorithm for Unsupervised Community Detection27 Sep 2025
- 2025Deep Cut-informed Graph Embedding and Clustering9 Mar 2025
- 2023CueGCL: Cluster-aware Personalized Self-Training for Unsupervised Graph Contrastive Learning18 Nov 2023