Multi-Task Curriculum Graph Contrastive Learning with Clustering Entropy Guidance
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 to improve learning diversity, but commonly used random augmentation methods may destroy inherent semantics and cause noise; 2) the fixed positive and negative sample selection strategy is limited to deal with complex real data, thereby impeding the model's capability to capture fine-grained patterns and relationships. To reduce these problems, we propose the Clustering-guided Curriculum Graph contrastive Learning (CCGL) framework. CCGL uses clustering entropy as the guidance of the following graph augmentation and contrastive learning. Specifically, according to the clustering entropy, the intra-class edges and important features are emphasized in augmentation. Then, a multi-task curriculum learning scheme is proposed, which employs the clustering guidance to shift the focus from the discrimination task to the clustering task. In this way, the sample selection strategy of contrastive learning can be adjusted adaptively from early to late stage, which enhances the model's flexibility for complex data structure. Experimental results demonstrate that CCGL has achieved excellent performance compared to state-of-the-art competitors.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringContrastive LearningDiversityGraph ClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
ConCur: Self-supervised graph representation based on contrastive learning with curriculum negative sampling
Contrastive learning has made breakthrough advancements in graph representation learning, which encourages the representation of positive samples to be close and those of negative samples to be far away. However, existin…
Contrastive LearningGraph Representation LearningNode ClassificationRepresentation Learning+1Revisiting Modularity Maximization for Graph Clustering: A Contrastive Learning Perspective
Graph clustering, a fundamental and challenging task in graph mining, aims to classify nodes in a graph into several disjoint clusters. In recent years, graph contrastive learning (GCL) has emerged as a dominant line of …
ClusteringCommunity DetectionContrastive LearningGraph Clustering+1Multi-level Graph Subspace Contrastive Learning for Hyperspectral Image Clustering
Hyperspectral image (HSI) clustering is a challenging task due to its high complexity. Despite subspace clustering shows impressive performance for HSI, traditional methods tend to ignore the global-local interaction in …
ClusteringContrastive Learninghyperspectral image clusteringImage ClusteringAdversarial Curriculum Graph Contrastive Learning with Pair-wise Augmentation
Graph contrastive learning (GCL) has emerged as a pivotal technique in the domain of graph representation learning. A crucial aspect of effective GCL is the caliber of generated positive and negative samples, which is in…
Contrastive LearningGraph Representation LearningRepresentation LearningGLCC: A General Framework for Graph-Level Clustering
This paper studies the problem of graph-level clustering, which is a novel yet challenging task. This problem is critical in a variety of real-world applications such as protein clustering and genome analysis in bioinfor…
ClusteringContrastive LearningDeep ClusteringRepresentation Learning