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 条
[1]  
[Anonymous], 1973, Pattern Classification and Scene Analysis
[2]  
[Anonymous], 2019, Distil networks: The 2019 bad bot report
[3]   Densest Subgraph in Streaming and MapReduce [J].
Bahmani, Bahman ;
Kumar, Ravi ;
Vassilvitskii, Sergei .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (05) :454-465
[4]  
Ban YK, 2018, Arxiv, DOI arXiv:1805.10053
[5]  
Beutel Alex, 2013, WWW, DOI DOI 10.1145/2488388.2488400
[6]   Flowless: Extracting Densest Subgraphs Without Flow Computations [J].
Boob, Digvijay ;
Gao, Yu ;
Peng, Richard ;
Sawlani, Saurabh ;
Tsourakakis, Charalampos ;
Wang, Di ;
Wang, Junxing .
WEB CONFERENCE 2020: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2020), 2020, :573-583
[7]  
CAIDA, 2013, The CAIDA UCSD anonymized internet traces
[8]  
Charikar M., 2000, Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000. Proceedings (Lecture Notes in Computer Science Vol.1913), P84
[9]  
Chekuri C, 2022, PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, P1531
[10]   Dense Subgraph Extraction with Application to Community Detection [J].
Chen, Jie ;
Saad, Yousef .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2012, 24 (07) :1216-1230