paper-with-me

홈 › Papers

Deep Contrastive Graph Learning with Clustering-Oriented Guidance

2024-02-25 · Mulin Chen, Bocheng Wang, Xuelong Li

Graph Convolutional Network (GCN) has exhibited remarkable potential in improving graph-based clustering. To handle the general clustering scenario without a prior graph, these models estimate an initial graph beforehand to apply GCN. Throughout the literature, we have witnessed that 1) most models focus on the initial graph while neglecting the original features. Therefore, the discriminability of the learned representation may be corrupted by a low-quality initial graph; 2) the training procedure lacks effective clustering guidance, which may lead to the incorporation of clustering-irrelevant information into the learned graph. To tackle these problems, the Deep Contrastive Graph Learning (DCGL) model is proposed for general data clustering. Specifically, we establish a pseudo-siamese network, which incorporates auto-encoder with GCN to emphasize both the graph structure and the original features. On this basis, feature-level contrastive learning is introduced to enhance the discriminative capacity, and the relationship between samples and centroids is employed as the clustering-oriented guidance. Afterward, a two-branch graph learning mechanism is designed to extract the local and global structural relationships, which are further embedded into a unified graph under the cluster-level contrastive guidance. Experimental results on several benchmark datasets demonstrate the superiority of DCGL against state-of-the-art algorithms.

📄 PDF Abstract BibTeX arXiv:2402.16012

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringContrastive LearningGraph Learning

Methods 이 논문이 사용한 방법론

Focus 설명 없음
Contrastive Learning 설명 없음
GCN A Graph Convolutional Network, or GCN, is an approach for semi-supervised learning on graph-structured data. It is based on an efficient variant of [convolutional neural…

Similar Papers 제목 키워드 기반

From Representation to Clusters: A Contrastive Learning Approach for Attributed Hypergraph Clustering

2026-03-10 · Li Ni, Shuaikang Zeng, Lin Mu, Longlong Lin arxiv

Contrastive learning has demonstrated strong performance in attributed hypergraph clustering. Typically, existing methods based on contrastive learning first learn node embeddings and then apply clustering algorithms, su…

Representation LearningContrastive Learning

Multi-Task Curriculum Graph Contrastive Learning with Clustering Entropy Guidance

2024-08-22 · Chusheng Zeng, Bocheng Wang, Jinghui Yuan, Rong Wang 외

Recent advances in unsupervised deep graph clustering have been significantly promoted by contrastive learning. Despite the strides, most graph contrastive learning models face challenges: 1) graph augmentation is used t…

ClusteringContrastive LearningDiversityGraph Clustering

Structure-enhanced Contrastive Learning for Graph Clustering

2024-08-19 · Xunlian Wu, Jingqi Hu, Anqi Zhang, Yining Quan 외

Graph clustering is a crucial task in network analysis with widespread applications, focusing on partitioning nodes into distinct groups with stronger intra-group connections than inter-group ones. Recently, contrastive …

ClusteringContrastive LearningData AugmentationGraph Clustering

NCAGC: A Neighborhood Contrast Framework for Attributed Graph Clustering

2022-06-16 · Tong Wang, Guanyu Yang, Qijia He, Zhenquan Zhang 외

Attributed graph clustering is one of the most fundamental tasks among graph learning field, the goal of which is to group nodes with similar representations into the same cluster without human annotations. Recent studie…

ClusteringContrastive LearningData AugmentationGraph Clustering+2

Reinforcement Graph Clustering with Unknown Cluster Number

2023-08-13 · Yue Liu, Ke Liang, Jun Xia, Xihong Yang 외

Deep graph clustering, which aims to group nodes into disjoint clusters by neural networks in an unsupervised manner, has attracted great attention in recent years. Although the performance has been largely improved, the…

ClusteringGraph ClusteringRepresentation Learning