VulnDS: Top-k Vulnerable SME Detection System in Networked-Loans

Groups of small and medium enterprises (SMEs) can back each other to obtain loans from banks and thus form guarantee networks. If the loan repayment of a small company in the network defaults, its backers are required to repay the loan. Therefore, risk over networked enterprises may cause significant contagious damage. In real-world applications, it is critical to detect top vulnerable nodes in such complex financial network with near real-time performance. To address this challenge, we introduce VulnDS: a top-k vulnerable SME detection system for large-scale financial networks, which is deployed in our collaborated bank. First, we model the risks of the guaranteed-loan network by a probabilistic graph, which consists of the guarantee-loan network structure, self-risk probability for the nodes and diffusion probability for the edges. Moreover, to identify the vulnerable enterprises, we propose a sampling-based approach with tight theoretical guarantee. Novel optimization techniques are developed in order to scale for large networks. We conduct extensive experiments on 3 real financial datasets, in addition with 5 large-scale benchmark networks. The evaluation results show that the proposed method can achieve up to 100x speedup ratio compared with baseline methods. Case studies are further conducted in the deployed system to demonstrate the effectiveness of proposed model.

[1]  Haixun Wang,et al.  Distance-Constraint Reachability Computation in Uncertain Graphs , 2011, Proc. VLDB Endow..

[2]  Bart Baesens,et al.  Using Neural Network Rule Extraction and Decision Tables for Credit - Risk Evaluation , 2003, Manag. Sci..

[3]  Liqing Zhang,et al.  Credit Card Fraud Detection Using Convolutional Neural Networks , 2016, ICONIP.

[4]  Peter J. Haas,et al.  On synopses for distinct-value estimation under multiset operations , 2007, SIGMOD '07.

[5]  H. Brendan McMahan,et al.  Follow-the-Regularized-Leader and Mirror Descent: Equivalence Theorems and L1 Regularization , 2011, AISTATS.

[6]  Yan Jia,et al.  Identifying Vulnerable Nodes of Complex Networks in Cascading Failures Induced by Node-Based Attacks , 2013 .

[7]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[8]  Ming Xu,et al.  Determinants of the guarantee circles: The case of Chinese listed firms , 2012 .

[9]  Tie-Yan Liu,et al.  LightGBM: A Highly Efficient Gradient Boosting Decision Tree , 2017, NIPS.

[10]  Kartik Anand,et al.  Filling in the blanks: network structure and interbank contagion , 2014, SSRN Electronic Journal.

[11]  Dawei Cheng,et al.  Risk Assessment for Networked-guarantee Loans Using High-order Graph Attention Representation , 2019, IJCAI.

[12]  Heng-Tze Cheng,et al.  Wide & Deep Learning for Recommender Systems , 2016, DLRS@RecSys.

[13]  Jukka-Pekka Onnela,et al.  Complex networks in the study of financial and social systems , 2006 .

[14]  Franklin Allen,et al.  Financial Connections and Systemic Risk , 2010 .

[15]  Edith Cohen,et al.  Summarizing data using bottom-k sketches , 2007, PODC '07.

[16]  W. S. Chow,et al.  Social network, social trust and shared goals in organizational knowledge sharing , 2008, Inf. Manag..

[17]  David J. Hand,et al.  Statistical Classification Methods in Consumer Credit Scoring: a Review , 1997 .

[18]  Véronique Van Vlasselaer,et al.  Using social network knowledge for detecting spider constructions in social security fraud , 2013, 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013).

[19]  Fei Tan,et al.  A Deep Learning Approach to Competing Risks Representation in Peer-to-Peer Lending , 2019, IEEE Transactions on Neural Networks and Learning Systems.

[20]  M. Jacomy,et al.  ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software , 2014, PloS one.

[21]  Ei Ei Thu,et al.  Transforming Model Oriented Program into Android Source Code Based on Drools Rule Engine , 2017 .

[22]  Shaohua Tan,et al.  NetRating: Credit Risk Evaluation for Loan Guarantee Chain in China , 2017, PAISI.

[23]  Lei Zheng,et al.  Joint Deep Modeling of Users and Items Using Reviews for Recommendation , 2017, WSDM.

[24]  Spiros Bougheas,et al.  Complex Financial Networks and Systemic Risk: A Review , 2014, SSRN Electronic Journal.

[25]  Dawei Cheng,et al.  Prediction Defaults for Networked-guarantee Loans , 2017, 2018 24th International Conference on Pattern Recognition (ICPR).

[26]  George Kollios,et al.  k-nearest neighbors in uncertain graphs , 2010, Proc. VLDB Endow..

[27]  Piet Van Mieghem,et al.  Nodal vulnerability to targeted attacks in power grids , 2018, Applied Network Science.

[28]  G. Masters A rasch model for partial credit scoring , 1982 .

[29]  B. Engelmann,et al.  The Basel II risk parameters : estimation, validation, stress testing--with applications to loan risk management , 2011 .

[30]  A. Lo,et al.  Consumer Credit Risk Models Via Machine-Learning Algorithms , 2010 .

[31]  Olaf Zukunft,et al.  Evaluating the Scaling of Graph-Algorithms for Big Data Using GraphX , 2016, 2016 2nd International Conference on Open and Big Data (OBD).

[32]  Qiang Yang,et al.  The Lifecycle and Cascade of WeChat Social Messaging Groups , 2015, WWW.

[33]  Arijit Khan,et al.  An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs , 2019, Proc. VLDB Endow..

[34]  Serge Abiteboul,et al.  On the representation and querying of sets of possible worlds , 1987, SIGMOD '87.

[35]  Xuemin Lin,et al.  Bring Order into the Samples: A Novel Scalable Method for Influence Maximization , 2017, IEEE Transactions on Knowledge and Data Engineering.

[36]  Arunabha Sen,et al.  Identification of K most vulnerable nodes in multi-layered network using a new model of interdependency , 2014, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[37]  Ankitkumar Patel Sales transaction system using redis database , 2015 .