Network structure in money-laundering detection
Slide 5 in the PDFA graph \(G=(\mathcal V,\mathcal E,\mathbf X)\) has nodes \(\mathcal V\) (here transactions), edges \(\mathcal E\) (a payment flow from one transaction to the next) and a feature matrix \(\mathbf X\in\mathbb R^{n\times d}\); the label \(y_v=1\) marks an illicit transaction (scams, ransomware, dark markets). The Elliptic graph has 203,769 transactions, 234,355 payment flows, 165 features per transaction and 49 time steps. The task is node classification.



NN_L9_elliptic_timesteps








