Graph neural networks (GNNs) have shown promise in addressing graph-related problems, including node classification. However, conventional GNNs assume an even distribution of data across classes, which is often not the case in real-world scenarios, where certain classes are severely underrepresented. This leads to suboptimal performance of standard GNNs on imbalanced graphs. In this paper, we introduce a unique approach that tackles imbalanced classification on graphs by considering graph heterophily. We investigate the intricate relationship between class imbalance and graph heterophily, revealing that minority classes not only exhibit a scarcity of samples but also manifest lower levels of homophily, facilitating the propagation of erroneous information among neighboring nodes. Drawing upon this insight, we propose an efficient method, called Fast Im-GBK, which integrates an imbalance classification strategy with heterophily-aware GNNs to effectively address the class imbalance problem while significantly reducing training time. Our experiments on real-world graphs demonstrate our model's superiority in classification performance and efficiency for node classification tasks compared to existing baselines.

在这篇论文中，我们介绍了一种独特的方法，通过考虑图异质性来解决图中的不平衡分类问题。我们研究了类别不平衡和图异质性之间的错综复杂关系，发现少数类别不仅样本稀缺，而且表现出较低的同质性水平，这导致错误信息在相邻节点之间传播。基于这一洞察，我们提出了一种名为Fast Im-GBK的高效方法，将不平衡分类策略与意识到异质性的图神经网络相结合，以有效解决类别不平衡问题，并显著减少训练时间。我们在实际图数据上的实验证明了我们的模型在节点分类任务中相比现有基线方法具有更好的分类性能和效率。

基于异质性的图神经网络用于不平衡分类