Money-Mule Detection as a Relational Learning Problem: A Study on the RBIH NFPC Dataset

The paper presents a graph‑based method for detecting money‑mule accounts by treating a bank’s relational schema as a heterogeneous graph and scoring each account using multi‑hop neighbourhoods, per‑column encoders, relative‑time encoding, and HeteroGraphSAGE message passing. On a five‑year RBIH retail‑banking dataset of 400 million transactions, the model achieves 83 % precision and a 0.5 % false‑alarm rate, recovering nine out of ten held‑out mules and outperforming tree‑based baselines in recall while maintaining precision deep into the alert queue. The approach can be deployed directly on a bank’s existing database without constructing a custom feature graph.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.