GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering
Bruno Deprez, Bart Baesens, Tim Verdonck, Wouter Verbeke

TL;DR
GARG-AML is a scalable, transparent graph-based method for detecting money-laundering smurfing activities, providing interpretable risk scores suitable for large financial networks.
Contribution
It introduces a simple, network-based approach that balances detection accuracy with speed and interpretability, avoiding complex deep learning models.
Findings
GARG-AML matches or exceeds state-of-the-art performance.
It efficiently processes large transaction graphs.
Uses only basic network features for effective detection.
Abstract
Purpose: We introduce GARG-AML, a fast and transparent graph-based method to catch `smurfing', a common money-laundering tactic. It assigns a single, easy-to-understand risk score to every account in both directed and undirected networks. Unlike overly complex models, it balances detection power with the speed and clarity that investigators require. Methodology: The method maps an account's immediate and secondary connections (its second-order neighbourhood) into an adjacency matrix. By measuring the density of specific blocks within this matrix, GARG-AML flags patterns that mimic smurfing behaviour. We further boost the model's performance using decision trees and gradient-boosting classifiers, testing the results against current state-of-the-art on both synthetic and open-source data. Findings: GARG-AML matches or beats state-of-the-art performance across all tested datasets.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
