TL;DR
This paper introduces ReDiRect, an unsupervised, distributed graph-based framework for detecting complex money laundering patterns efficiently, overcoming scalability and false positive issues in existing methods.
Contribution
It presents a novel graph partitioning approach and evaluation metric, improving detection accuracy and efficiency over state-of-the-art techniques.
Findings
ReDiRect outperforms existing methods in efficiency and accuracy.
The framework effectively detects complex laundering patterns in large transaction graphs.
Validation on real and synthetic datasets demonstrates practical applicability.
Abstract
Money launderers take advantage of limitations in existing detection approaches by hiding their financial footprints in a deceitful manner. They manage this by replicating transaction patterns that the monitoring systems cannot easily distinguish. As a result, criminally gained assets are pushed into legitimate financial channels without drawing attention. Algorithms developed to monitor money flows often struggle with scale and complexity. The difficulty of identifying such activities is further intensified by the (persistent) inability of current solutions to control the excessive number of false positive signals produced by rigid, risk-based rules systems. We propose a framework called ReDiRect (REduce, DIstribute, and RECTify), specifically designed to overcome these challenges. The primary contribution of our work is a novel framing of this problem in an unsupervised setting; where…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
