Deep Modularity Networks with Diversity--Preserving Regularization
원문 초록
Graph clustering plays a crucial role in graph representation learning but often faces challenges in achieving feature-space diversity. While Deep Modularity Networks (DMoN) leverage modularity maximization and collapse regularization to ensure structural separation, they do not explicitly encourage diversity in the feature space among clusters. We address this limitation by proposing Deep Modularity Networks with Diversity-Preserving Regularization (DMoN-DPR), which introduces three novel regularization terms: distance-based for inter-cluster separation, variance-based for intra-cluster diversity, and entropy-based for balanced assignments. Our method enhances clustering performance on benchmark datasets, namely Cora, CiteSeer, PubMed, Coauthor CS, and Coauthor Physics, achieving significant improvements in Normalized Mutual Information (NMI), and F1 scores. These results demonstrate the effectiveness of incorporating diversity-preserving regularizations in creating meaningful and interpretable clusters, especially in feature-rich datasets.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Simultaneous Linear Multi-view Attributed Graph Representation Learning and Clustering
Marginalized graph autoencoder for graph clustering
Efficient graph convolution for joint node representation learning and clustering
Tri-Learn Graph Fusion Network for Attributed Graph Clustering
Self-supervised Learning of Echocardiographic Video Representations via Online Cluster Distillation
Efficient Skill Discovery via Regret-Aware Optimization
토론
이 논문과 연결된 포럼 글이 아직 없습니다.