QTIAH-GNN: Quantity and Topology Imbalance-aware Heterogeneous Graph Neural Network for Bankruptcy Prediction
Yucheng Liu, Zipeng Gao, Xiangyang Liu, Pengfei Luo, Yang Yang, Hui Xiong
摘要
The timely prediction of bankruptcy is highly desirable to guarantee an upward spiral for overall societal well-being. By extracting multifaceted information from the business interaction networks, Graph Neural Networks (GNNs) may be able to automatically make more informed predictions for bankruptcy, as compared to methods that rely heavily on abundant manpower to a large extent. Yet in real applications, bankruptcy prediction faces the key issue of quantity-imbalance: data usually comes with a long-tailed distribution wherein bankrupt corporates occupy the least of the data proportion but are our target to be identified. Apart from that, the topology-imbalance issue behind graph-structural data exacerbates prediction deterioration: feature propagation is dominated by non-bankrupt nodes through messages passing between nodes; thus, bankrupt nodes receive highly confusing information and could be easily assimilated by nearby non-bankrupt nodes. Unfortunately, the existing GNN methods are not immune to these two imbalance issues. To tackle the challenging but practically useful scenario, we propose a novel bankruptcy prediction model called the Quantity and Topology Imbalance-Aware Heterogeneous Graph Neural Network (QTIAH-GNN) to boost the final performance. Specifically, QTIAH-GNN employs the multi-hierarchy label-aware neighbor selection to conquer the topology-imbalance issue by using the class-semantic representation and the learnable parameterized similarity metric, and employs the imbalance-oriented loss to obtain the optimal tradeoff between the accuracies of the majority and minority classes. In experiments, we evaluate the proposed QTIAH-GNN on two large-scale, real-world datasets. The results show that QTIAH-GNN outperforms other state-of-the-art baselines in terms of prediction accuracy with superior efficiency and generalization ability, has stronger robustness to data imbalance, and provides meaningful model interpretation.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Class-Imbalanced Graph Learning without Class RebalancingZhining Liu, Ruizhong Qiu, Zhichen Zeng, Hyunsik Yoo 等ICML 2024 · 被引用 35 次
- Achieving Personalized Privacy-Preserving Graph Neural Network via Topology AwarenessDian Lei, Zijun Song, Yanli Yuan, Chunhai Li 等WWW 2025 · 被引用 6 次
它引用的顶会 Paper7
- Beyond Homophily in Graph Neural Networks: Current Limitations and Effective DesignsJiong Zhu, Yujun Yan, Lingxiao Zhao, Mark Heimann 等NeurIPS 2020 · 被引用 1,490 次
- MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph EmbeddingXinyu Fu, Jiani Zhang, Ziqiao Meng, Irwin KingWWW 2020 · 被引用 1,149 次
- Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple MethodsDerek Lim, Felix Hohne, Xiuyu Li, Sijia Linda Huang 等NeurIPS 2021 · 被引用 534 次
- Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud DetectionYang Liu, Xiang Ao, Zidi Qin, Jianfeng Chi 等WWW 2021 · 被引用 527 次
- GraphENS: Neighbor-Aware Ego Network Synthesis for Class-Imbalanced Node ClassificationJoonhyung Park, Jaeyun Song, Eunho YangICLR 2022 · 被引用 145 次
相关 Paper
- Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node ClassificationXingcheng Fu, Yuecen Wei, Qingyun Sun, Haonan Yuan 等WWW 2023 · 被引用 41 次
- Topology-Imbalance Learning for Semi-Supervised Node ClassificationDeli Chen, Yankai Lin, Guangxiang Zhao, Xuancheng Ren 等NeurIPS 2021 · 被引用 143 次
- Attribute-Enhanced Similarity Ranking for Sparse Link PredictionJoão Mattos, Zexi Huang, Mert Kosan, Ambuj K. Singh 等KDD 2025 · 被引用 1 次
- Collaborative Metapath Enhanced Corporate Default Risk Assessment on Heterogeneous GraphZheng Zhang, Yingsheng Ji, Jiachen Shen, Yushu Chen 等WWW 2024 · 被引用 5 次
- Conflicting Node Discrimination Graph Neural Network for Semi-supervised Node ClassificationWenjun Wang, Xin Cao, Yawen Li, XiaoLong Deng 等KDD 2026
