Spade

Author:

Jiang Jiaxin1,Li Yuan1,He Bingsheng1,Hooi Bryan1,Chen Jia2,Kang Johan Kok Zhi2

Affiliation:

1. National University of Singapore

2. GrabTaxi Holdings

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference35 articles.

1. [n.d.]. Distil Networks: The 2019 Bad Bot Report. https://www.bluecubesecurity.com/wp-content/uploads/bad-bot-report-2019LR.pdf. [n.d.]. Distil Networks: The 2019 Bad Bot Report. https://www.bluecubesecurity.com/wp-content/uploads/bad-bot-report-2019LR.pdf.

2. Bahman Bahmani , Ravi Kumar , and Sergei Vassilvitskii . 2012 . Densest Subgraph in Streaming and MapReduce . Proceedings of the VLDB Endowment 5 , 5 (2012). Bahman Bahmani, Ravi Kumar, and Sergei Vassilvitskii. 2012. Densest Subgraph in Streaming and MapReduce. Proceedings of the VLDB Endowment 5, 5 (2012).

3. Yikun Ban , Xin Liu , Tianyi Zhang , Ling Huang , Yitao Duan , Xue Liu , and Wei Xu. 2018. BadLink: Combining Graph and Information-Theoretical Features for Online Fraud Group Detection. arXiv preprint arXiv:1805.10053 ( 2018 ). Yikun Ban, Xin Liu, Tianyi Zhang, Ling Huang, Yitao Duan, Xue Liu, and Wei Xu. 2018. BadLink: Combining Graph and Information-Theoretical Features for Online Fraud Group Detection. arXiv preprint arXiv:1805.10053 (2018).

4. CopyCatch

5. Flowless: Extracting Densest Subgraphs Without Flow Computations

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. RUSH: Real-Time Burst Subgraph Detection in Dynamic Graphs;Proceedings of the VLDB Endowment;2024-07

2. Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries;Proceedings of the VLDB Endowment;2024-07

3. SMoTeF: Smurf money laundering detection using temporal order and flow analysis;Applied Intelligence;2024-06-07

4. A Survey on Graph Neural Networks for Fraud Detection in Ride Hailing Platforms;2024 7th International Conference on Artificial Intelligence and Big Data (ICAIBD);2024-05-24

5. A Survey on the Densest Subgraph Problem and its Variants;ACM Computing Surveys;2024-04-30

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3