Topology-Imbalance Learning for Semi-Supervised Node Classification
Deli Chen, Yankai Lin, Guangxiang Zhao, Xuancheng Ren, Peng Li, Jie, Zhou, Xu Sun

TL;DR
This paper identifies a new form of imbalance in graph data called topology imbalance, analyzes its impact on semi-supervised node classification, and proposes a model-agnostic re-weighting method to mitigate it, improving classification performance.
Contribution
The paper introduces the concept of topology imbalance in graphs, provides a unified analysis with quantity imbalance, and proposes the ReNode method to address it effectively.
Findings
ReNode effectively reduces topology imbalance effects.
Topology imbalance significantly affects GNN performance.
The method is generalizable across different GNN architectures.
Abstract
The class imbalance problem, as an important issue in learning node representations, has drawn increasing attention from the community. Although the imbalance considered by existing studies roots from the unequal quantity of labeled examples in different classes (quantity imbalance), we argue that graph data expose a unique source of imbalance from the asymmetric topological properties of the labeled nodes, i.e., labeled nodes are not equal in terms of their structural role in the graph (topology imbalance). In this work, we first probe the previously unknown topology-imbalance issue, including its characteristics, causes, and threats to semi-supervised node classification learning. We then provide a unified view to jointly analyzing the quantity- and topology- imbalance issues by considering the node influence shift phenomenon with the Label Propagation algorithm. In light of our…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks · Advanced Computing and Algorithms · Imbalanced Data Classification Techniques
