P2P credit risk management with KG-GNN: a knowledge graph and graph neural network-based approach

被引:0
|
作者
Zhu, Yuhao [1 ]
Wu, Desheng [1 ]
机构
[1] Univ Chinese Acad Sci, Sch Econ & Management, Beijing 101408, Peoples R China
关键词
Credit risk; P2P; risk management; knowledge graph; graph neural networks; DECISION-SUPPORT; EXTRACTION; REGRESSION;
D O I
10.1080/01605682.2024.2398762
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
Credit risk management is crucial for the credit loan decision-making process on P2P platforms, essential for mitigating credit defaults. The rapid decline of China's P2P platform market highlights the urgent need for Internet financial institutions to enhance their credit risk management strategies. Previous studies have applied machine learning to assess credit risk; however, their effectiveness is often hampered by a lack of consideration for semantic information and individual correlation. In response, we propose an innovative approach, KG-GNN, which integrates knowledge graph (KG) and graph neural network (GNN). KG-GNN leverages KG to encapsulate semantic information within complex categorical features and explore potential relationships between borrowers. Utilizing GNN, our framework extracts representation features from the KG to build comprehensive and accurate credit risk models. Our findings indicate that KG-GNN not only can predict credit risk more accurately than conventional machine learning models but also improves the stream model performance by over 20% through KG and GNN-based data augmentation techniques. By integrating KG with GNN, our approach enriches the methodologies for credit risk management and can be adapted to other data mining challenges that require processing complex semantic and relational information, thereby enhancing model learning capabilities.
引用
收藏
页数:15
相关论文
共 50 条
  • [21] Social Network-Based Trust Computing in P2P Environments
    Liu, Fengming
    Ding, Yongsheng
    2008 7TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-23, 2008, : 2130 - 2135
  • [22] Spectral Clustering and Cost-Sensitive Deep Neural Network-Based Undersampling Approach for P2P Lending Data
    Jadwal, Pankaj Kumar
    Jain, Sonal
    Agarwal, Basant
    INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY AND WEB ENGINEERING, 2020, 15 (04) : 37 - 52
  • [23] Spatial Regression Models to Improve P2P Credit Risk Management
    Agosto, Arianna
    Giudici, Paolo
    Leach, Tom
    FRONTIERS IN ARTIFICIAL INTELLIGENCE, 2019, 2
  • [24] Choosing Portfolios Based on Bipartite Graph of P2P Lending Networks
    Yong D.
    Lu C.
    Cuiqing J.
    Data Analysis and Knowledge Discovery, 2019, 3 (12): : 76 - 83
  • [25] BotSpot: fast graph based identification of structured P2P bots
    Venkatesh, Bharath
    Choudhury, Sudip Hazra
    Nagaraja, Shishir
    Balakrishnan, N.
    JOURNAL OF COMPUTER VIROLOGY AND HACKING TECHNIQUES, 2015, 11 (04) : 247 - 261
  • [26] A clustering route algorithm of p2p networks based on knodel graph
    Shi Chang Qiong
    Wang Da Wei
    Huang Hui
    Huang Yuanyuan
    PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING SYSTEMS, 2009, : 837 - 840
  • [27] Graph-based P2P Traffic Classification at the Internet Backbone
    Iliofotou, Marios
    Kim, Hyun-chul
    Faloutsos, Michalis
    Mitzenmacher, Michael
    Pappu, Prashanth
    Varghese, George
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS, 2009, : 37 - +
  • [28] A scalable P2P overlay based on arrangement graph with minimized overhead
    Lu, Ssu-Hsuan
    Li, Kuan-Ching
    Lai, Kuan-Chou
    Chung, Yeh-Ching
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2014, 7 (04) : 497 - 510
  • [29] A scalable P2P overlay based on arrangement graph with minimized overhead
    Ssu-Hsuan Lu
    Kuan-Ching Li
    Kuan-Chou Lai
    Yeh-Ching Chung
    Peer-to-Peer Networking and Applications, 2014, 7 : 497 - 510
  • [30] FCM-Based P2P Network Lending Platform Credit Risk Dynamic Assessment
    Han, Huijian
    Yang, Ye
    Zhang, Rui
    Brekhna, Brekhna
    IEEE ACCESS, 2020, 8 : 195664 - 195674