FlowScope: Spotting Money Laundering Based on Graphs
Xiangfeng Li, Shenghua Liu, Zifeng Li, Xiaotian Han, Chuan Shi, Bryan Hooi, He Huang, Xueqi Cheng
Abstract
Given a graph of the money transfers between accounts of a bank, how can we detect money laundering? Money laundering refers to criminals using the bank's services to move massive amounts of illegal money to untraceable destination accounts, in order to inject their illegal money into the legitimate financial system. Existing graph fraud detection approaches focus on dense subgraph detection, without considering the fact that money laundering involves high-volume flows of funds through chains of bank accounts, thereby decreasing their detection accuracy. Instead, we propose to model the transactions using a multipartite graph, and detect the complete flow of money from source to destination using a scalable algorithm, FlowScope. Theoretical analysis shows that FlowScope provides guarantees in terms of the amount of money that fraudsters can transfer without being detected. FlowScope outperforms state-of-the-art baselines in accurately detecting the accounts involved in money laundering, in both injected and real-world data settings.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext eff083f5-dbcd-4350-850b-b7297964f3e2Cited by top-tier papers13
- Robust Spammer Detection by Nash Reinforcement LearningYingtong Dou, Guixiang Ma, Philip S. Yu, Sihong XieKDD 2020 · 59 citations
- Faster and Scalable Algorithms for Densest Subgraph and DecompositionElfarouk Harb, Kent Quanrud, Chandra ChekuriNeurIPS 2022 · 48 citations
- PathEnum: Towards Real-Time Hop-Constrained s-t Path EnumerationShixuan Sun, Yuhang Chen, Bingsheng He, Bryan HooiSIGMOD 2021 · 28 citations
- Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with DiversityAtsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, Charalampos E. TsourakakisKDD 2023 · 12 citations
- Node-aware Bi-smoothing: Certified Robustness against Graph Injection AttacksYuni Lai, Yulin Zhu, Bailin Pan, Kai ZhouS&P 2024 · 11 citations
Related papers
- DenseFlow: Spotting Cryptocurrency Money Laundering in Ethereum Transaction GraphsDan Lin, Jiajing Wu, Yunmei Yu, Qishuang Fu et al.WWW 2024 · 34 citations
- Towards Collaborative Anti-Money Laundering Among Financial InstitutionsZhihua Tian, Yuan Ding, Xiang Yu, Enchao Gong et al.WWW 2025 · 2 citations
- Detecting Cash-out Users via Dense SubgraphsYingsheng Ji, Zheng Zhang, Xinlei Tang, Jiachen Shen et al.KDD 2022 · 14 citations
- TempASD: Temporal Anomalous Subgraph Discovery in Large-Scale Dynamic Financial NetworksXiaolin Han, Yikun Zhang, Chenhao Ma, Lingyun Song et al.KDD 2025 · 3 citations
- UniGAD: Unifying Multi-level Graph Anomaly DetectionYiqing Lin, Jianheng Tang, Chenyi Zi, H. Vicky Zhao et al.NeurIPS 2024 · 32 citations
