REFUEL: rule extraction for imbalanced neural node classification

Author:

Markwald Marco,Demidova Elena

Abstract

AbstractImbalanced graph node classification is a highly relevant and challenging problem in many real-world applications. The inherent data scarcity, a central characteristic of this task, substantially limits the performance of neural classification models driven solely by data. Given the limited instances of relevant nodes and complex graph structures, current methods fail to capture the distinct characteristics of node attributes and graph patterns within the underrepresented classes. In this article, we propose REFUEL—a novel approach for highly imbalanced node classification problems in graphs. Whereas symbolic and neural methods have complementary strengths and weaknesses when applied to such problems, REFUEL combines the power of symbolic and neural learning in a novel neural rule-extraction architecture. REFUEL captures the class semantics in the automatically extracted rule vectors. Then, REFUEL augments the graph nodes with the extracted rules vectors and adopts a Graph Attention Network-based neural node embedding, enhancing the downstream neural node representation. Our evaluation confirms the effectiveness of the proposed REFUEL approach for three real-world datasets with different minority class sizes. REFUEL achieves at least a 4% point improvement in precision on the minority classes of 1.5–2% compared to the baselines.

Funder

Bundesministerium für Wirtschaft und Klimaschutz

Rheinische Friedrich-Wilhelms-Universität Bonn

Publisher

Springer Science and Business Media LLC

Reference24 articles.

1. Alarab, I., Prakoonwit, S., & Nacer, M. I. (2020). Competence of graph convolutional networks for anti-money laundering in bitcoin blockchain. In Proceedings of the 2020 5th international conference on machine learning technologies (pp. 23–27).

2. Bénard, C., Biau, G., Veiga, S. D., & Scornet, E. (2021). Interpretable random forests via rule extraction. In The 24th international conference on artificial intelligence and statistics, Volume 130 of Proceedings of Machine Learning Research (pp. 937–945).

3. Bojchevski, A., & Günnemann, S. (2018). Deep gaussian embedding of graphs: Unsupervised inductive learning via ranking. In Proceedings of the 6th International Conference on Learning Representations. OpenReview.net.

4. Bologna, G. (2021). A rule extraction technique applied to ensembles of neural networks, random forests, and gradient-boosted trees. Algorithms, 14(12), 339. https://doi.org/10.3390/A14120339

5. Boruah, A. N., Biswas, S. K., & Bandyopadhyay, S. (2022). Rule extraction from decision tree: Transparent expert system of rules. Concurrency and Computation: Practice and Experience, 34(15), e6935. https://doi.org/10.1002/CPE.6935

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3