GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks

by   Tianxiang Zhao, et al.
Penn State University

Node classification is an important research topic in graph learning. Graph neural networks (GNNs) have achieved state-of-the-art performance of node classification. However, existing GNNs address the problem where node samples for different classes are balanced; while for many real-world scenarios, some classes may have much fewer instances than others. Directly training a GNN classifier in this case would under-represent samples from those minority classes and result in sub-optimal performance. Therefore, it is very important to develop GNNs for imbalanced node classification. However, the work on this is rather limited. Hence, we seek to extend previous imbalanced learning techniques for i.i.d data to the imbalanced node classification task to facilitate GNN classifiers. In particular, we choose to adopt synthetic minority over-sampling algorithms, as they are found to be the most effective and stable. This task is non-trivial, as previous synthetic minority over-sampling algorithms fail to provide relation information for newly synthesized samples, which is vital for learning on graphs. Moreover, node attributes are high-dimensional. Directly over-sampling in the original input domain could generates out-of-domain samples, which may impair the accuracy of the classifier. We propose a novel framework, GraphSMOTE, in which an embedding space is constructed to encode the similarity among the nodes. New samples are synthesize in this space to assure genuineness. In addition, an edge generator is trained simultaneously to model the relation information, and provide it for those new samples. This framework is general and can be easily extended into different variations. The proposed framework is evaluated using three different datasets, and it outperforms all baselines with a large margin.


page 1

page 2

page 3

page 4


Synthetic Over-sampling for Imbalanced Node Classification with Graph Neural Networks

In recent years, graph neural networks (GNNs) have achieved state-of-the...

GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction

Recent years have witnessed great success in handling node classificatio...

GDM: Dual Mixup for Graph Classification with Limited Supervision

Graph Neural Networks (GNNs) require a large number of labeled graph sam...

Imbalanced Node Classification Beyond Homophilic Assumption

Imbalanced node classification widely exists in real-world networks wher...

GraphSR: A Data Augmentation Algorithm for Imbalanced Node Classification

Graph neural networks (GNNs) have achieved great success in node classif...

Beyond Real-world Benchmark Datasets: An Empirical Study of Node Classification with GNNs

Graph Neural Networks (GNNs) have achieved great success on a node class...

AdaGCN:Adaptive Boosting Algorithm for Graph Convolutional Networks on Imbalanced Node Classification

The Graph Neural Network (GNN) has achieved remarkable success in graph ...

Please sign up or login with your details

Forgot password? Click here to reset