Spade plus : A Generic Real-Time Fraud Detection Framework on Dynamic Graphs

被引:1
作者
Jiang, Jiaxin [1 ]
Chen, Yuhang [1 ]
He, Bingsheng [1 ]
Chen, Min [2 ]
Chen, Jia [2 ]
机构
[1] Natl Univ Singapore, Sch Comp, Singapore 119077, Singapore
[2] Grab, Data Sci, Integr, Singapore 528605, Singapore
基金
新加坡国家研究基金会;
关键词
Fraud; Image edge detection; Real-time systems; Measurement; Heuristic algorithms; Semantics; Pipelines; Dense subgraph discovery; dynamic graphs; fraud detection; SUBGRAPH;
D O I
10.1109/TKDE.2024.3394155
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Real-time fraud detection remains a pressing issue for many financial and e-commerce platforms. Grab, , a prominent technology company in Southeast Asia, addresses this by constructing a transactional graph. This graph aids in pinpointing dense subgraphs, possibly indicative of fraudster networks. Notably, prevalent methods are designed for static graphs, neglecting the evolving nature of transaction graphs. This static approach is ill-suited to the real-time necessities of modern industries. In our earlier work, Spade, , the focus was mainly on edge insertions. However, Grab's 's operational demands necessitated managing outdated transactions. Persistently adding edges without a deletion mechanism might inadvertently lead to densely connected legitimate communities. To resolve this, we present Spade+, , a refined real-time fraud detection system at Grab. . Contrary to Spade, , Spade+ manages both edge additions and removals. Leveraging an incremental approach, Spade+ promptly identifies suspicious communities in large graphs. Moreover, Spade+ efficiently handles batch updates and employs edge packing to diminish latency. A standout feature of Spade+ is its user-friendly APIs, allowing for tailored fraud detection methods. Developers can easily integrate their specific metrics, which Spade+ autonomously refines. Rigorous evaluations validate the prowess of Spade+; ; fraud detection mechanisms powered by Spade+ were up to a million times faster than their static counterparts.
引用
收藏
页码:7058 / 7073
页数:16
相关论文
共 45 条
[11]   Computational methods for dynamic graphs [J].
Cortes, C ;
Pregibon, D ;
Volinsky, C .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2003, 12 (04) :950-970
[12]  
Danh Le-Phuoc, 2012, The Semantic Web. 11th International Semantic Web Conference (ISWC 2012). Proceedings, P300, DOI 10.1007/978-3-642-35173-0_20
[13]   Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters [J].
Dou, Yingtong ;
Liu, Zhiwei ;
Sun, Li ;
Deng, Yutong ;
Peng, Hao ;
Yu, Philip S. .
CIKM '20: PROCEEDINGS OF THE 29TH ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT, 2020, :315-324
[14]  
Dourisboure Yon, 2007, P 16 INT C WORLD WID, P461, DOI [10.1145/1242572.1242635, DOI 10.1145/1242572.1242635]
[15]   Efficient Densest Subgraph Computation in Evolving Graphs [J].
Epasto, Alessandro ;
Lattanzi, Silvio ;
Sozio, Mauro .
PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW 2015), 2015, :300-310
[16]  
Ester M., 1996, P 2 INT C KNOWL DISC, P226, DOI DOI 10.5555/3001460.3001507
[17]   DBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation [J].
Gan, Junhao ;
Tao, Yufei .
SIGMOD'15: PROCEEDINGS OF THE 2015 ACM SIGMOD INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2015, :519-530
[18]  
Gibson D., 2005, PROC 31 INT C VERY L, P721
[19]   Dense Subgraph Discovery KDD 2015 tutorial [J].
Gionis, Aristides ;
Tsourakakis, Charalampos E. .
KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, :2313-2314
[20]  
Goldberg A. V., 1984, Finding a maximum density subgraph, DOI [10.5555/894477, DOI 10.5555/894477]