NodeImport: Imbalanced Node Classification with Node Importance Assessment
Not on the map. Why?
Abstract (arXiv)
In real-world applications, node classification on graphs often faces the challenge of class imbalance, where majority classes dominate training, resulting in biased model performance. Traditional GNNs often struggle in such scenarios, as they tend to overfit to majority classes while underrepresenting minority classes. Existing solutions, which either prioritize nodes based on class size or synthesize new nodes for minority classes, often fall short of effectively addressing this imbalance issue. This paper introduces an approach to class-imbalanced node classification by utilizing a balanced meta-set for importance measurement, where a training node is considered significant if it enhances model performance under an unbiased setting. Our method identifies important nodes that can counteract class imbalance and utilizes them for model training, allowing for fine-grained and dynamic node selection throughout the training process. We theoretically derive a formula to directly assess node importance, reducing computational overhead and providing an intuitive threshold for node selection. Guided by this metric, we develop a novel framework that filters valuable labeled, unlabeled, and synthetic nodes that enhance model performance in an unbiased context. A key advantage of this framework is its separation of the synthetic node generation process from the filtering process, ensuring compatibility with various node generation methods. Furthermore, we introduce a strategy to construct a high-quality meta-set that closely approximates the overall feature distribution, ensuring robust representation of each class. We evaluate our framework, NodeImport, across multiple datasets using popular GNN architectures, demonstrating its superiority over existing baselines. Our results highlight the flexibility and effectiveness of the framework in mitigating class imbalance, leading to improved outcomes.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 44 of its 68 references that are in the map. First posted on arXiv 15 Jul 2026.
Builds on
44 of 68 references.
References · 44
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 987
32 more
- 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 987
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 970
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2018Learning to Reweight Examples for Robust Deep Learningcited by 670
- 2020Long-tail learning via logit adjustmentcited by 605
- 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 592
- 2021Deep Long-Tailed Learning: A Surveycited by 416
- 2020Balanced Meta-Softmax for Long-Tailed Visual Recognitioncited by 397
- 2020Equalization Loss for Long-Tailed Object Recognitioncited by 285
- 2017A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applicationscited by 260
- 2022Prioritized Training on Points that are Learnable, Worth Learning, and Not Yet Learntcited by 233
- 2020GLISTER: Generalization based Data Subset Selection for Efficient and Robust Learningcited by 224
- 2020Graph Random Neural Network for Semi-Supervised Learning on Graphscited by 213
- 2020Disentangling Label Distribution for Long-tailed Visual Recognitioncited by 172
- 2021GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networkscited by 147
- 2021RSG: A Simple but Effective Module for Learning Imbalanced Datasetscited by 61
- 2021Topology-Imbalance Learning for Semi-Supervised Node Classificationcited by 56
- 2021ImGAGN:Imbalanced Network Embedding via Generative Adversarial Graph Networkscited by 51
- 2023Towards Sustainable Learning: Coresets for Data-efficient Deep Learningcited by 44
- 2022TAM: Topology-Aware Margin Loss for Class-Imbalanced Node Classificationcited by 41
- 2021GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Predictioncited by 36
- 2020Class-Weighted Classification: Trade-offs and Robust Approachescited by 30
- 2022LTE4G: Long-Tail Experts for Graph Neural Networkscited by 30
- 2023Class-Imbalanced Learning on Graphs: A Surveycited by 24
- 2021Test Distribution-Aware Active Learning: A Principled Approach Against Distribution Shift and Outlierscited by 22
- 2024Partitioning Message Passing for Graph Fraud Detectioncited by 21
- 2023GraphSR: A Data Augmentation Algorithm for Imbalanced Node Classificationcited by 19
- 2023GraphSHA: Synthesizing Harder Samples for Class-Imbalanced Node Classificationcited by 17
- 2023Rethinking Semi-Supervised Imbalanced Node Classification from Bias-Variance Decompositioncited by 13
- 2023Imbalanced Node Classification Beyond Homophilic Assumptioncited by 7
- 2018Gradient Agreement as an Optimization Objective for Meta-Learningcited by 5
- 2024Automated Loss function Search for Class-imbalanced Node Classificationcited by 1
Built on by
Not cited yet.