Contrastive Self-supervised Learning for Graph Classification
Graph classification is a widely studied problem and has broad applications. In many real-world problems, the number of labeled graphs available for training classification models is limited, which renders these models prone to overfitting. To address this problem, we propose two approaches based on contrastive self-supervised learning (CSSL) to alleviate overfitting. In the first approach, we use CSSL to pretrain graph encoders on widely-available unlabeled graphs without relying on human-provided labels, then finetune the pretrained encoders on labeled graphs. In the second approach, we develop a regularizer based on CSSL, and solve the supervised classification task and the unsupervised CSSL task simultaneously. To perform CSSL on graphs, given a collection of original graphs, we perform data augmentation to create augmented graphs out of the original graphs. An augmented graph is created by consecutively applying a sequence of graph alteration operations. A contrastive loss is defined to learn graph encoders by judging whether two augmented graphs are from the same original graph. Experiments on various graph classification datasets demonstrate the effectiveness of our proposed methods.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationData AugmentationGeneral ClassificationGraph ClassificationSelf-Supervised LearningSimilar Papers 제목 키워드 기반
CORE: Contrastive Masked Feature Reconstruction on Graphs
In the rapidly evolving field of self-supervised learning on graphs, generative and contrastive methodologies have emerged as two dominant approaches. Our study focuses on masked feature reconstruction (MFR), a generativ…
Self-Supervised LearningGraph ClassificationContrastive LearningNode ClassificationGraphCL: Contrastive Self-Supervised Learning of Graph Representations
We propose Graph Contrastive Learning (GraphCL), a general framework for learning node representations in a self supervised manner. GraphCL learns node embeddings by maximizing the similarity between the representations …
Contrastive LearningInductive LearningNode ClassificationSelf-Supervised LearningFastGCL: Fast Self-Supervised Learning on Graphs via Contrastive Neighborhood Aggregation
Graph contrastive learning (GCL), as a popular approach to graph self-supervised learning, has recently achieved a non-negligible effect. To achieve superior performance, the majority of existing GCL methods elaborate on…
ClassificationContrastive LearningData AugmentationGraph Classification+2Applying Self-supervised Learning to Network Intrusion Detection for Network Flows with Graph Neural Network
Graph Neural Networks (GNNs) have garnered intensive attention for Network Intrusion Detection System (NIDS) due to their suitability for representing the network traffic flows. However, most present GNN-based methods fo…
Binary ClassificationContrastive LearningGraph AttentionGraph Embedding+4Graph Contrastive Learning for Anomaly Detection
Graph-based anomaly detection has been widely used for detecting malicious activities in real-world applications. Existing attempts to address this problem have thus far focused on structural feature engineering or learn…
Anomaly DetectionBinary ClassificationContrastive LearningFeature Engineering+1