Spade: A Real-Time Fraud Detection Framework on Evolving Graphs

被引:10
作者
Jiang, Jiaxin [1 ]
Li, Yuan [1 ]
He, Bingsheng [1 ]
Hooi, Bryan [1 ]
Chen, Jia [2 ]
Kang, Johan Kok Zhi [2 ]
机构
[1] Natl Univ Singapore, Singapore, Singapore
[2] GrabTaxi Holdings, Singapore, Singapore
来源
PROCEEDINGS OF THE VLDB ENDOWMENT | 2022年 / 16卷 / 03期
关键词
Crime - Graphic methods;
D O I
10.14778/3570690.3570696
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Real-time fraud detection is a challenge for most financial and electronic commercial platforms. To identify fraudulent communities, Grab, one of the largest technology companies in Southeast Asia, forms a graph from a set of transactions and detects dense subgraphs arising from abnormally large numbers of connections among fraudsters. Existing dense subgraph detection approaches focus on static graphs without considering the fact that transaction graphs are highly dynamic. Moreover, detecting dense subgraphs from scratch with graph updates is time consuming and cannot meet the real-time requirement in industry. Therefore, we introduce an incremental real-time fraud detection framework called Spade. Spade can detect fraudulent communities in hundreds of microseconds on million-scale graphs by incrementally maintaining dense subgraphs. Furthermore, Spade supports batch updates and edge grouping to reduce response latency. Lastly, Spade provides simple but expressive APIs for the design of evolving fraud detection semantics. Developers plug their customized suspiciousness functions into Spade which incrementalizes their semantics without recasting their algorithms. Extensive experiments show that Spade detects fraudulent communities in real time on million-scale graphs. Peeling algorithms incrementalized by Spade are up to a million times faster than the static version.
引用
收藏
页码:461 / 469
页数:9
相关论文
共 35 条
[1]  
[Anonymous], 2013, P 7 ACM C RECOMMENDE
[2]   Densest Subgraph in Streaming and MapReduce [J].
Bahmani, Bahman ;
Kumar, Ravi ;
Vassilvitskii, Sergei .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (05) :454-465
[3]  
Ban YK, 2018, Arxiv, DOI arXiv:1805.10053
[4]  
Beutel A., 2013, P 22 INT C WORLD WID, P119
[5]   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
[6]  
Charikar M., 2000, Approximation Algorithms for Combinatorial Optimization. Third International Workshop, APPROX 2000. Proceedings (Lecture Notes in Computer Science Vol.1913), P84
[7]  
Chekuri C, 2022, PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, P1531
[8]   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
[9]   Computational methods for dynamic graphs [J].
Cortes, C ;
Pregibon, D ;
Volinsky, C .
JOURNAL OF COMPUTATIONAL AND GRAPHICAL STATISTICS, 2003, 12 (04) :950-970
[10]  
Distil Networks, 2019 BAD BOT REP