Financial Default Prediction via Motif-preserving Graph Neural Network with Curriculum Learning

被引:7
作者
Wang, Daixin [1 ]
Zhang, Zhiqiang [1 ]
Zhao, Yeyu [1 ]
Huang, Kai [1 ]
Kang, Yulin [1 ]
Zhou, Jun [1 ]
机构
[1] Ant Grp, Hangzhou, Peoples R China
来源
PROCEEDINGS OF THE 29TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2023 | 2023年
关键词
Default Prediction; Graph Neural Network; Network Motif; FRAUD; INFORMATION;
D O I
10.1145/3580305.3599351
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
User financial default prediction plays a critical role in credit risk forecasting and management. It aims at predicting the probability that the user will fail to make the repayments in the future. Previous methods mainly extract a set of user individual features regarding his own profiles and behaviors and build a binary-classification model to make default predictions. However, these methods cannot get satisfied results, especially for users with limited information. Although recent efforts suggest that default prediction can be improved by social relations, they fail to capture the higher-order topology structure at the level of small subgraph patterns. In this paper, we fill in this gap by proposing a motif-preserving Graph Neural Network with curriculum learning (MotifGNN) to jointly learn the lower-order structures from the original graph and higher-order structures from multi-view motif-based graphs for financial default prediction. Specifically, to solve the problem of weak connectivity in motif-based graphs, we design the motif-based gating mechanism. It utilizes the information learned from the original graph with good connectivity to strengthen the learning of the higher-order structure. And considering that the motif patterns of different samples are highly unbalanced, we propose a curriculum learning mechanism on the whole learning process to more focus on the samples with uncommon motif distributions. Extensive experiments on one public dataset and two industrial datasets all demonstrate the effectiveness of our proposed method.
引用
收藏
页码:2233 / 2242
页数:10
相关论文
共 47 条
[1]  
Ahmed Nesreen, 2020, IEEE T KNOWLEDGE DAT
[2]   Motif-based communities in complex networks [J].
Arenas, A. ;
Fernandez, A. ;
Fortunato, S. ;
Gomez, S. .
JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2008, 41 (22)
[3]   Higher-order organization of complex networks [J].
Benson, Austin R. ;
Gleich, David F. ;
Leskovec, Jure .
SCIENCE, 2016, 353 (6295) :163-166
[4]   A Bayesian dichotomous model with asymmetric link for fraud in insurance [J].
Bermudez, Ll. ;
Perez, J. M. ;
Ayuso, M. ;
Gomez, E. ;
Vazquez, F. J. .
INSURANCE MATHEMATICS & ECONOMICS, 2008, 42 (02) :779-786
[5]   Data mining for credit card fraud: A comparative study [J].
Bhattacharyya, Siddhartha ;
Jha, Sanjeev ;
Tharakunnel, Kurian ;
Westland, J. Christopher .
DECISION SUPPORT SYSTEMS, 2011, 50 (03) :602-613
[6]  
Bo DY, 2021, AAAI CONF ARTIF INTE, V35, P3950
[7]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[8]  
Carranza Aldo G, 2018, ARXIV181002959
[9]   How Do the Open Source Communities Address Usability and UX Issues? An Exploratory Study [J].
Cheng, Jinghui ;
Guo, Jin L. C. .
CHI 2018: EXTENDED ABSTRACTS OF THE 2018 CHI CONFERENCE ON HUMAN FACTORS IN COMPUTING SYSTEMS, 2018,
[10]  
Dareddy MR, 2019, IEEE INT CONF BIG DA, P1052, DOI 10.1109/BigData47090.2019.9005670