GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering

• URL: http://arxiv.org/abs/2506.04292v2
• Date: Thu, 02 Oct 2025 12:29:35 GMT
• Title: GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering
• Authors: Bruno Deprez, Bart Baesens, Tim Verdonck, Wouter Verbeke,
• Abstract summary: This paper introduces a novel graph-based method, GARG-AML, for efficient and effective anti-money laundering (AML)<n>It quantifies smurfing risk, a popular money laundering method, by providing each node in the network with a single interpretable score.<n>The proposed method strikes a balance among computational efficiency, detection power and transparency.
• Score: 5.4807970361321585
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Purpose: This paper introduces a novel graph-based method, GARG-AML, for efficient and effective anti-money laundering (AML). It quantifies smurfing risk, a popular money laundering method, by providing each node in the network with a single interpretable score. The proposed method strikes a balance among computational efficiency, detection power and transparency. Different versions of GARG-AML are introduced for undirected and directed networks. Methodology: GARG-AML constructs the adjacency matrix of a node's second-order neighbourhood in a specific way. This allows us to use the density of different blocks in the adjacency matrix to express the neighbourhood's resemblance to a pure smurfing pattern. GARG-AML is extended using a decision tree and gradient-boosting classifier to increase its performance even more. The methods are tested on synthetic and on open-source data against the current state-of-the-art in AML. Findings: We find that GARG-AML obtains state-of-the-art performance on all datasets. We illustrate that GARG-AML scales well to massive transactions graphs encountered at financial institutions. By leveraging only the adjacency matrix of the second-order neighbourhood and basic network features, this work highlights the potential of fundamental network properties towards advancing fraud detection. Originality: This paper uses only basic network features and expert knowledge on smurfing to construct a performant AML system. The originality lies in the translation of smurfing detection to these features and network representation. Our proposed method is built around the real business needs of scalability and interpretability. It therefore provides a solution that can be easily implemented at financial institutions or incorporated in existing AML solutions.

Related papers

• Detecting Fraud in Financial Networks: A Semi-Supervised GNN Approach with Granger-Causal Explanations [5.407319151576265]
  Fraudulent activity in the financial industry costs billions annually.<n>This article proposes SAGE-FIN, a semi-supervised graph neural network (GNN) based approach with Granger causal explanations for Financial Interaction Networks.<n>We empirically validate the favorable performance of SAGE-FIN on a real-world dataset, Bipartite Edge-And-Node Attributed financial network (Elliptic++), with Granger-causal explanations for the identified fraudulent items without any prior assumption on the network structure.
  arXiv  Detail & Related papers  (2025-06-25T12:04:40Z)
• NDCG-Consistent Softmax Approximation with Accelerated Convergence [67.10365329542365]
  We propose novel loss formulations that align directly with ranking metrics.<n>We integrate the proposed RG losses with the highly efficient Alternating Least Squares (ALS) optimization method.<n> Empirical evaluations on real-world datasets demonstrate that our approach achieves comparable or superior ranking performance.
  arXiv  Detail & Related papers  (2025-06-11T06:59:17Z)
• Deep Learning Approaches for Anti-Money Laundering on Mobile Transactions: Review, Framework, and Directions [51.43521977132062]
  Money laundering is a financial crime that obscures the origin of illicit funds.<n>The proliferation of mobile payment platforms and smart IoT devices has significantly complicated anti-money laundering investigations.<n>This paper conducts a comprehensive review of deep learning solutions and the challenges associated with their use in AML.
  arXiv  Detail & Related papers  (2025-03-13T05:19:44Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD.<n>In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD.<n>In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• Privacy-Preserving Graph-Based Machine Learning with Fully Homomorphic Encryption for Collaborative Anti-Money Laundering [4.1964397179107085]
  This research presents a novel privacy-preserving approach for collaborative AML machine learning. It facilitates secure data sharing across institutions and borders while preserving privacy and regulatory compliance. The research contributes two key privacy-preserving pipelines.
  arXiv  Detail & Related papers  (2024-11-05T09:13:53Z)
• Identifying Money Laundering Subgraphs on the Blockchain [5.377744640870357]
  Anti-Money Laundering involves the identification of money laundering crimes in financial activities. Recent studies advanced AML through the lens of graph-based machine learning. RevTrack is a graph-based framework that enables large-scale AML analysis with a lower cost and a higher accuracy.
  arXiv  Detail & Related papers  (2024-10-10T22:01:14Z)
• Advancing Anomaly Detection: Non-Semantic Financial Data Encoding with LLMs [49.57641083688934]
  We introduce a novel approach to anomaly detection in financial data using Large Language Models (LLMs) embeddings. Our experiments demonstrate that LLMs contribute valuable information to anomaly detection as our models outperform the baselines.
  arXiv  Detail & Related papers  (2024-06-05T20:19:09Z)
• The Shape of Money Laundering: Subgraph Representation Learning on the Blockchain with the Elliptic2 Dataset [6.209290101460395]
  Subgraph representation learning is a technique for analyzing local structures (or shapes) within complex networks. We introduce Elliptic2, a large graph dataset containing 122K labeled subgraphs of Bitcoin clusters. We find immediate practical value in this approach and the potential for a new standard in anti-money laundering and forensic analytics in cryptocurrencies.
  arXiv  Detail & Related papers  (2024-04-29T21:19:41Z)
• Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning [56.45977379288308]
  Masked autoencoder (MAE) learns to reconstruct masked graph edges or node features. Contrastive Learning (CL) maximizes the similarity between augmented views of the same graph. We propose graph contrastive masked autoencoder (GCMAE) framework to unify MAE and CL.
  arXiv  Detail & Related papers  (2023-10-24T05:06:06Z)
• Topology-Agnostic Detection of Temporal Money Laundering Flows in Billion-Scale Transactions [0.03626013617212666]
  We propose a framework to efficiently construct a temporal graph of sequential transactions. We evaluate the scalability and the effectiveness of our framework against two state-of-the-art solutions for detecting suspicious flows of transactions.
  arXiv  Detail & Related papers  (2023-09-24T15:11:58Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• Finding Money Launderers Using Heterogeneous Graph Neural Networks [0.0]
  This paper introduces a graph neural network (GNN) approach to identify money laundering activities within a large heterogeneous network. We extend the homogeneous GNN method known as the Message Passing Neural Network (MPNN) to operate effectively on a heterogeneous graph. Our findings highlight the importance of using an appropriate GNN architecture when combining information in heterogeneous graphs.
  arXiv  Detail & Related papers  (2023-07-25T13:49:15Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• LaundroGraph: Self-Supervised Graph Representation Learning for Anti-Money Laundering [5.478764356647437]
  LaundroGraph is a novel self-supervised graph representation learning approach. It provides insights to assist the anti-money laundering reviewing process. To the best of our knowledge, this is the first fully self-supervised system within the context of AML detection.
  arXiv  Detail & Related papers  (2022-10-25T21:58:02Z)
• IBP Regularization for Verified Adversarial Robustness via Branch-and-Bound [85.6899802468343]
  We present IBP-R, a novel verified training algorithm that is both simple effective. We also present UPB, a novel robustness based on $beta$-CROWN, that reduces the cost state-of-the-art branching algorithms.
  arXiv  Detail & Related papers  (2022-06-29T17:13:25Z)
• Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxies [65.92826041406802]
  We propose a Proxy-based deep Graph Metric Learning approach from the perspective of graph classification. Multiple global proxies are leveraged to collectively approximate the original data points for each class. We design a novel reverse label propagation algorithm, by which the neighbor relationships are adjusted according to ground-truth labels.
  arXiv  Detail & Related papers  (2020-10-26T14:52:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.