Multi-Scale Subgraph Contrastive Learning
Graph-level contrastive learning, aiming to learn the representations for each graph by contrasting two augmented graphs, has attracted considerable attention. Previous studies usually simply assume that a graph and its augmented graph as a positive pair, otherwise as a negative pair. However, it is well known that graph structure is always complex and multi-scale, which gives rise to a fundamental question: after graph augmentation, will the previous assumption still hold in reality? By an experimental analysis, we discover the semantic information of an augmented graph structure may be not consistent as original graph structure, and whether two augmented graphs are positive or negative pairs is highly related with the multi-scale structures. Based on this finding, we propose a multi-scale subgraph contrastive learning architecture which is able to characterize the fine-grained semantic information. Specifically, we generate global and local views at different scales based on subgraph sampling, and construct multiple contrastive relationships according to their semantic associations to provide richer self-supervised signals. Extensive experiments and parametric analyzes on eight graph classification real-world datasets well demonstrate the effectiveness of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningGraph ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented View
Graph anomaly detection (GAD) is a vital task in graph-based machine learning and has been widely applied in many real-world applications. The primary goal of GAD is to capture anomalous nodes from graph datasets, which …
Anomaly DetectionContrastive LearningGraph Anomaly DetectionAdaGCL: Adaptive Subgraph Contrastive Learning to Generalize Large-scale Graph Training
Training graph neural networks (GNNs) with good generalizability on large-scale graphs is a challenging problem. Existing methods mainly divide the input graph into multiple subgraphs and train them in different batches …
Contrastive LearningData AugmentationNode ClassificationContrastive Representation Learning Based on Multiple Node-centered Subgraphs
As the basic element of graph-structured data, node has been recognized as the main object of study in graph representation learning. A single node intuitively has multiple node-centered subgraphs from the whole graph (e…
Contrastive LearningGraph Representation LearningRepresentation LearningLine Graph Contrastive Learning for Link Prediction
Link prediction tasks focus on predicting possible future connections. Most existing researches measure the likelihood of links by different similarity scores on node pairs and predict links between nodes. However, the s…
Contrastive LearningLink PredictionNode ClassificationPredictionSOLA-GCL: Subgraph-Oriented Learnable Augmentation Method for Graph Contrastive Learning
Graph contrastive learning has emerged as a powerful technique for learning graph representations that are robust and discriminative. However, traditional approaches often neglect the critical role of subgraph structures…
Contrastive LearningData AugmentationGraph LearningTransfer Learning