Log In Sign Up

Graph Few-shot Learning via Knowledge Transfer

by   Huaxiu Yao, et al.

Towards the challenging problem of semi-supervised node classification, there have been extensive studies. As a frontier, Graph Neural Networks (GNNs) have aroused great interest recently, which update the representation of each node by aggregating information of its neighbors. However, most GNNs have shallow layers with a limited receptive field and may not achieve satisfactory performance especially when the number of labeled nodes is quite small. To address this challenge, we innovatively propose a graph few-shot learning (GFL) algorithm that incorporates prior knowledge learned from auxiliary graphs to improve classification accuracy on the target graph. Specifically, a transferable metric space characterized by a node embedding and a graph-specific prototype embedding function is shared between auxiliary graphs and the target, facilitating the transfer of structural knowledge. Extensive experiments and ablation studies on four real-world graph datasets demonstrate the effectiveness of our proposed model.


page 1

page 2

page 3

page 4


Semantic Graph Neural Network with Multi-measure Learning for Semi-supervised Classification

Graph Neural Networks (GNNs) have attracted increasing attention in rece...

Flip Initial Features: Generalization of Neural Networks for Semi-supervised Node Classification

Graph neural networks (GNNs) have been widely used under semi-supervised...

Towards Self-Explainable Graph Neural Network

Graph Neural Networks (GNNs), which generalize the deep neural networks ...

Asymmetric Graph Representation Learning

Despite the enormous success of graph neural networks (GNNs), most exist...

Not All Neighbors Are Worth Attending to: Graph Selective Attention Networks for Semi-supervised Learning

Graph attention networks (GATs) are powerful tools for analyzing graph d...

Recurrent Attention Walk for Semi-supervised Classification

In this paper, we study the graph-based semi-supervised learning for cla...

Designing labeled graph classifiers by exploiting the Rényi entropy of the dissimilarity representation

Representing patterns as labeled graphs is becoming increasingly common ...

Code Repositories