Supervised Graph Contrastive Learning for Few-shot Node Classification

2022-03-29 · Zhen Tan, Kaize Ding, Ruocheng Guo, Huan Liu

Graphs are present in many real-world applications, such as financial fraud detection, commercial recommendation, and social network analysis. But given the high cost of graph annotation or labeling, we face a severe graph label-scarcity problem, i.e., a graph might have a few labeled nodes. One example of such a problem is the so-called \textit{few-shot node classification}. A predominant approach to this problem resorts to \textit{episodic meta-learning}. In this work, we challenge the status quo by asking a fundamental question whether meta-learning is a must for few-shot node classification tasks. We propose a new and simple framework under the standard few-shot node classification setting as an alternative to meta-learning to learn an effective graph encoder. The framework consists of supervised graph contrastive learning with novel mechanisms for data augmentation, subgraph encoding, and multi-scale contrast on graphs. Extensive experiments on three benchmark datasets (CoraFull, Reddit, Ogbn) show that the new framework significantly outperforms state-of-the-art meta-learning based methods.

📄 PDF Abstract BibTeX arXiv:2203.15936

Code (0)

등록된 구현이 없습니다.

Tasks

Classification Contrastive Learning Data Augmentation Few-Shot Learning Fraud Detection Meta-Learning Node Classification

Methods 이 논문이 사용한 방법론

Contrastive Learning 설명 없음

BASE 설명 없음

Transductive Linear Probing: A Novel Framework for Few-Shot Node Classification

2022-12-11 · Zhen Tan, Song Wang, Kaize Ding, Jundong Li 외

Few-shot node classification is tasked to provide accurate predictions for nodes from novel classes with only few representative labeled nodes. This problem has drawn tremendous attention for its projection to prevailing…

Classification Contrastive Learning Meta-Learning Node Classification+2

Graph Contrastive Learning Meets Graph Meta Learning: A Unified Method for Few-shot Node Tasks

2023-09-19 · Hao liu, Jiarui Feng, Lecheng Kong, DaCheng Tao 외

Graph Neural Networks (GNNs) have become popular in Graph Representation Learning (GRL). One fundamental application is few-shot node classification. Most existing methods follow the meta learning paradigm, showing the a…

CoLA Contrastive Learning Graph Representation Learning Meta-Learning+2

Contrastive Meta-Learning for Few-shot Node Classification

2023-06-27 · Song Wang, Zhen Tan, Huan Liu, Jundong Li

Few-shot node classification, which aims to predict labels for nodes on graphs with only limited labeled nodes as references, is of great significance in real-world graph mining tasks. Particularly, in this paper, we ref…

Classification Graph Mining Meta-Learning Node Classification

Supervised Contrastive Learning with Structure Inference for Graph Classification

2022-03-15 · Hao Jia, Junzhong Ji, Minglong Lei

Advanced graph neural networks have shown great potentials in graph classification tasks recently. Different from node classification where node embeddings aggregated from local neighbors can be directly used to learn no…

Classification Contrastive Learning Graph Classification Graph Neural Network+1

GraphCL: Contrastive Self-Supervised Learning of Graph Representations

2020-07-15 · Hakim Hafidi, Mounir Ghogho, Philippe Ciblat, Ananthram Swami

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 Learning Inductive Learning Node Classification Self-Supervised Learning