ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networks
arXiv:2106.02817
Abstract
Imbalanced classification on graphs is ubiquitous yet challenging in many real-world applications, such as fraudulent node detection. Recently, graph neural networks (GNNs) have shown promising performance on many network analysis tasks. However, most existing GNNs have almost exclusively focused on the balanced networks, and would get unappealing performance on the imbalanced networks. To bridge this gap, in this paper, we present a generative adversarial graph network model, called ImGAGN to address the imbalanced classification problem on graphs. It introduces a novel generator for graph structure data, named GraphGenerator, which can simulate both the minority class nodes' attribute distribution and network topological structure distribution by generating a set of synthetic minority nodes such that the number of nodes in different classes can be balanced. Then a graph convolutional network (GCN) discriminator is trained to discriminate between real nodes and fake (i.e., generated) nodes, and also between minority nodes and majority nodes on the synthetic balanced network. To validate the effectiveness of the proposed method, extensive experiments are conducted on four real-world imbalanced network datasets. Experimental results demonstrate that the proposed method ImGAGN outperforms state-of-the-art algorithms for semi-supervised imbalanced node classification task.
arXiv commentto be published in KDD'2021
References in corpus (11)
- Adam: A Method for Stochastic Optimization
- SMOTE: Synthetic Minority Over-sampling Technique
- Community detection in graphs
- Semi-Supervised Classification with Graph Convolutional Networks
- Cooperative Game Theory Approaches for Network Partitioning
- Inductive Representation Learning on Large Graphs
- A Review on Generative Adversarial Networks: Algorithms, Theory, and Applications
- A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications
- Adversarial Classifier for Imbalanced Problems
- Imbalanced Data Learning by Minority Class Augmentation using Capsule Adversarial Networks
- ImVerde: Vertex-Diminished Random Walk for Learning Network Representation from Imbalanced Data