Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
131 tokens/sec
GPT-4o
10 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Financial Default Prediction via Motif-preserving Graph Neural Network with Curriculum Learning (2403.06482v1)

Published 11 Mar 2024 in q-fin.RM and cs.LG

Abstract: 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 higherorder 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (49)
  1. Credit card fraud detection using adaboost and majority voting. IEEE access, 6:14277–14284, 2018.
  2. Using generative adversarial networks for improving classification effectiveness in credit card fraud detection. Information Sciences, 479:448–455, 2019.
  3. A review of data mining-based financial fraud detection research. In 2007 International Conference on Wireless Communications, Networking and Mobile Computing, pages 5519–5522. Ieee, 2007.
  4. Understanding default behavior in online lending. In CIKM, pages 2043–2052, 2019.
  5. A semi-supervised graph attentive network for financial fraud detection. In 2019 IEEE International Conference on Data Mining (ICDM), pages 598–607. IEEE, 2019.
  6. Cash-out user detection based on attributed heterogeneous information network with a hierarchical attention mechanism. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 946–953, 2019.
  7. Financial defaulter detection on online credit payment via multi-view attributed heterogeneous information network. In Proceedings of The Web Conference 2020, pages 785–795, 2020.
  8. Financial risk analysis for smes with graph-based supply chain mining. In Proceedings of the Twenty-Ninth International Conference on International Joint Conferences on Artificial Intelligence, pages 4661–4667, 2021.
  9. Temporal-aware graph neural network for credit risk prediction. In Proceedings of the 2021 SIAM International Conference on Data Mining (SDM), pages 702–710. SIAM, 2021.
  10. Estimation of graphlet counts in massive networks. IEEE transactions on neural networks and learning systems, 30(1):44–57, 2018.
  11. Higher-order network representation learning. In Companion Proceedings of the The Web Conference 2018, pages 3–4, 2018.
  12. Higher-order spectral clustering for heterogeneous graphs. arXiv preprint arXiv:1810.02959, 2018.
  13. Higher-order organization of complex networks. Science, 353(6295):163–166, 2016.
  14. Motif-based communities in complex networks. Journal of Physics A: Mathematical and Theoretical, 41(22):224001, 2008.
  15. Enhancing the network embedding quality with structural similarity. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, pages 147–156, 2017.
  16. Graph convolutional networks with motif-based attention. In Proceedings of the 28th ACM international conference on information and knowledge management, pages 499–508, 2019.
  17. Graph convolutional networks fusing motif-structure information. Scientific Reports, 12(1):1–12, 2022.
  18. Predicting customer value with social relationships via motif-based graph attention networks. In Proceedings of the Web Conference 2021, pages 3146–3157, 2021.
  19. Transaction aggregation as a strategy for credit card fraud detection. Data mining and knowledge discovery, 18(1):30–55, 2009.
  20. A bayesian dichotomous model with asymmetric link for fraud in insurance. Insurance: Mathematics and Economics, 42(2):779–786, 2008.
  21. Strategies for detecting fraudulent claims in the automobile insurance industry. European Journal of Operational Research, 2007.
  22. Data mining for credit card fraud: A comparative study. Decision support systems, 50(3):602–613, 2011.
  23. Distributed deep forest and its application to automatic detection of cash-out fraud. ACM Transactions on Intelligent Systems and Technology (TIST), 10(5):1–19, 2019.
  24. Geniepath: Graph neural networks with adaptive receptive paths. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 4424–4431, 2019.
  25. Credit risk and limits forecasting in e-commerce consumer lending service via multi-view-aware mixture-of-experts nets. In Proceedings of the 14th ACM international conference on web search and data mining, pages 229–237, 2021.
  26. Heterogeneous graph neural networks for malicious account detection. In Proceedings of the 27th ACM International Conference on Information and Knowledge Management, pages 2077–2085, 2018.
  27. Deep learning on graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 34:249–270, 2020.
  28. A comprehensive survey on graph neural networks. IEEE transactions on neural networks and learning systems, 32:4–24, 2020.
  29. Convolutional neural networks on graphs with fast localized spectral filtering. In Advances in Neural Information Processing Systems, 2016.
  30. Fastgcn: Fast learning with graph convolutional networks via importance sampling. In ICLR, 2018.
  31. Inductive representation learning on large graphs. In NIPS, pages 1024–1034, 2017.
  32. Graph attention networks. arXiv preprint arXiv:1710.10903, 2017.
  33. Multi-gcn: Graph convolutional networks for multi-view networks, with applications to global poverty. ArXiv, abs/1901.11213, 2019.
  34. Heterogeneous graph attention network. WWW, 2019.
  35. Spatio-temporal graph convolutional networks: A deep learning framework for traffic forecasting. In Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI), 2018.
  36. Network motifs: simple building blocks of complex networks. Science, 298(5594):824–827, 2002.
  37. Dynamic properties of network motifs contribute to biological network organization. PLoS biology, 3(11):e343, 2005.
  38. Detecting strong ties using network motifs. In Proceedings of the 26th International Conference on World Wide Web Companion, pages 983–992, 2017.
  39. Role-based graph embeddings. IEEE Transactions on Knowledge and Data Engineering, 2020.
  40. Motif-preserving temporal network embedding. In IJCAI, pages 1237–1243, 2020.
  41. Mbrep: Motif-based representation learning in heterogeneous networks. Expert Systems with Applications, 190:116031, 2022.
  42. Motif-preserving dynamic attributed network embedding. In Proceedings of the Web Conference 2021, pages 1629–1638, 2021.
  43. Beyond low-frequency information in graph convolutional networks. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 35, pages 3950–3957, 2021.
  44. Matthieu Latapy. Main-memory triangle computations for very large (sparse (power-law)) graphs. Theoretical computer science, 407(1-3):458–473, 2008.
  45. Leo Breiman. Random forests. Machine learning, 45(1):5–32, 2001.
  46. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pages 855–864, 2016.
  47. motif2vec: Motif aware node representation learning for heterogeneous networks. In 2019 IEEE International Conference on Big Data (Big Data), pages 1052–1059. IEEE, 2019.
  48. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907, 2016.
  49. Frank J Massey Jr. The kolmogorov-smirnov test for goodness of fit. Journal of the American statistical Association, 46(253):68–78, 1951.
Citations (5)

Summary

We haven't generated a summary for this paper yet.

X Twitter Logo Streamline Icon: https://streamlinehq.com