Anti-Money Laundering Alert Optimization Using Machine Learning with Graphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LNU6UBEKrecord.jsonopen to challenge →
read the original abstract
Money laundering is a global problem that concerns legitimizing proceeds from serious felonies (1.7-4 trillion euros annually) such as drug dealing, human trafficking, or corruption. The anti-money laundering systems deployed by financial institutions typically comprise rules aligned with regulatory frameworks. Human investigators review the alerts and report suspicious cases. Such systems suffer from high false-positive rates, undermining their effectiveness and resulting in high operational costs. We propose a machine learning triage model, which complements the rule-based system and learns to predict the risk of an alert accurately. Our model uses both entity-centric engineered features and attributes characterizing inter-entity relations in the form of graph-based features. We leverage time windows to construct the dynamic graph, optimizing for time and space efficiency. We validate our model on a real-world banking dataset and show how the triage model can reduce the number of false positives by 80% while detecting over 90% of true positives. In this way, our model can significantly improve anti-money laundering operations.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
BlazingAML: High-Throughput Anti-Money Laundering (AML) via Multi-Stage Graph Mining
BlazingAML uses a multi-stage graph mining framework and compiler to express fuzzy AML patterns, matching SOTA F1 scores while delivering 210x CPU and 333x GPU speedups on IBM datasets.
-
Extracting Money Laundering Transactions from Quasi-Temporal Graph Representation
ExSTraQt uses quasi-temporal graph representations and supervised learning to detect suspicious transactions, achieving F1 score uplifts of up to 1% on real data and over 8% on synthetic datasets compared to prior AML models.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.