Graph-Based Financial Fraud Detection: A Property-Centric Survey of Static, Temporal, Cycle-Aware, and Generative Methods and Their Evaluation

Authors

  • Daniel T. Ale Federal University of Technology Akure
  • E. O. Ogunti Federal University of Technology Akure
  • S. A. Oyetunji Federal University of Technology Akure
  • A. A. Ponnle Federal University of Technology Akure
  • K. B. Adedeji Federal University of Technology Akure

DOI:

https://doi.org/10.62411/jcta.18143

Keywords:

Financial Fraud, Money Laundering, Graph Neural Networks, Temporal Graphs, Diffusion Models, Graph Anomaly Detection, Score Matching

Abstract

Financial fraud is increasingly coordinated across multiple accounts and transactions, meaning that its evidence often lies in relationships between accounts, the sequence of events, and, in schemes such as money laundering and wash trading, closed loops of transfers rather than in individual records. This review examines graph-based methods for detecting such fraud, covering static and temporal graph neural networks, graph anomaly detection, cycle- and motif-aware methods, generative models, and the evaluation practices used to assess them. The review draws on 147 sources identified through a documented literature search protocol. Four findings emerge. First, no single method family performs best under all conditions: tree-based models remain highly competitive on feature-rich datasets, whereas graph-based and temporal models offer greater advantages when discriminative signals reside in relational structures or transaction sequences. Second, detecting cyclic laundering is fundamentally a representational problem: standard message-passing architectures have limited ability to capture cycle structures, while recent performance gains have been associated with representations that preserve the directed multigraph structure of transactions rather than simply increasing model complexity. Third, evaluation practices, including temporal leakage and threshold selection using test data, can inflate reported performance and undermine the reliability of comparisons. Fourth, a taxonomy of eight method families evaluated against four properties required for coordinated, temporal, and partially observed fraud detection—temporal awareness, probabilistic generation, cycle awareness, and intrinsic explainability—reveals that none of the reviewed families provides all four properties. This identifies a central research gap in the current literature. Building on these findings, the review proposes cyclic fraud as a structural stress test for future detection methods and provides an evaluation checklist to address the methodological weaknesses identified.

Author Biographies

Daniel T. Ale, Federal University of Technology Akure

Department of Electrical and Electronics Engineering, Federal University of Technology, Akure 340001, Ondo State, Nigeria

E. O. Ogunti, Federal University of Technology Akure

Department of Electrical and Electronics Engineering, Federal University of Technology, Akure 340001, Ondo State, Nigeria

S. A. Oyetunji, Federal University of Technology Akure

Department of Electrical and Electronics Engineering, Federal University of Technology, Akure 340001, Ondo State, Nigeria

A. A. Ponnle, Federal University of Technology Akure

Department of Electrical and Electronics Engineering, Federal University of Technology, Akure 340001, Ondo State, Nigeria

K. B. Adedeji, Federal University of Technology Akure

Department of Electrical and Electronics Engineering, Federal University of Technology, Akure 340001, Ondo State, Nigeria

References

Association of Certified Fraud Examiners, “Occupational Fraud 2024: A Report to the Nations,” 2024. [Online]. Available: https://legacy.acfe.com/report-to-the-nations/2024/

U.S. Department of the Treasury, “2024 National Money Laundering Risk Assessment,” 2024. [Online]. Available: https://home.treasury.gov/system/files/136/2024-National-Money-Laundering-Risk-Assessment.pdf

E. Li, M. Chen, S. Xiang, and L. Chen, “Graph Learning-Empowered Financial Fraud Detection: Progress and Future Directions,” Intell. Comput., vol. 4, Jan. 2025, doi: 10.34133/icomputing.0146.

S. Motie and B. Raahemi, “Financial fraud detection using graph neural networks: A systematic review,” Expert Syst. Appl., vol. 240, p. 122156, Apr. 2024, doi: 10.1016/j.eswa.2023.122156.

S. Serneels, “Detecting wash trading for nonfungible tokens,” Financ. Res. Lett., vol. 52, p. 103374, Mar. 2023, doi: 10.1016/j.frl.2022.103374.

M. Alenova, A. Utaliyeva, and K.-J. Li, “Detecting Hawala network for money laundering by graph mining,” J. Financ. Data Sci., vol. 10, p. 100147, Dec. 2024, doi: 10.1016/j.jfds.2024.100147.

F. Victor and A. M. Weintraud, “Detecting and Quantifying Wash Trading on Decentralized Cryptocurrency Exchanges,” in Proceedings of the Web Conference 2021, New York, NY, USA: ACM, Apr. 2021, pp. 23–32. doi: 10.1145/3442381.3449824.

T. Pourhabibi, K.-L. Ong, B. H. Kam, and Y. L. Boo, “Fraud detection: A systematic literature review of graph-based anomaly detection approaches,” Decis. Support Syst., vol. 133, p. 113303, Jun. 2020, doi: 10.1016/j.dss.2020.113303.

W. Hilal, S. A. Gadsden, and J. Yawney, “Financial Fraud: A Review of Anomaly Detection Techniques and Recent Advances,” Expert Syst. Appl., vol. 193, p. 116429, May 2022, doi: 10.1016/j.eswa.2021.116429.

E. W. T. Ngai, Y. Hu, Y. H. Wong, Y. Chen, and X. Sun, “The application of data mining techniques in financial fraud detection: A classification framework and an academic review of literature,” Decis. Support Syst., vol. 50, no. 3, pp. 559–569, Feb. 2011, doi: 10.1016/j.dss.2010.08.006.

J. West and M. Bhattacharya, “Intelligent financial fraud detection: A comprehensive review,” Comput. Secur., vol. 57, pp. 47–66, Mar. 2016, doi: 10.1016/j.cose.2015.09.005.

A. Ali et al., “Financial Fraud Detection Based on Machine Learning: A Systematic Literature Review,” Appl. Sci., vol. 12, no. 19, p. 9637, Sep. 2022, doi: 10.3390/app12199637.

R. J. Bolton and D. J. Hand, “Statistical Fraud Detection: A Review,” Stat. Sci., vol. 17, no. 3, pp. 235–255, Aug. 2002, doi: 10.1214/ss/1042727940.

Y. Ma, Y. Tian, N. Moniz, and N. V Chawla, “Class-Imbalanced Learning on Graphs: A Survey,” ACM Comput. Surv., vol. 57, no. 8, pp. 1–16, Aug. 2025, doi: 10.1145/3718734.

X. Wang, Z. Liu, J. Liu, and J. Liu, “Fraud detection on multi-relation graphs via imbalanced and interactive learning,” Inf. Sci., vol. 642, p. 119153, Sep. 2023, doi: 10.1016/j.ins.2023.119153.

M. Weber et al., “Anti-Money Laundering in Bitcoin: Experimenting with Graph Convolutional Networks for Financial Forensics,” Jul. 31, 2019. [Online]. Available: http://arxiv.org/abs/1908.02591

M. Zhang and Y. Chen, “Link Prediction Based on Graph Neural Networks,” in NeurIPS, 2018, pp. 5171–5181.

F. Poursafaei, S. Huang, K. Pelrine, and R. Rabbany, “Towards Better Evaluation for Dynamic Link Prediction,” in Advances in Neural Information Processing Systems 35, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2022, pp. 32928–32941. doi: 10.52202/068431-2386.

M. Schlichtkrull, T. N. Kipf, P. Bloem, R. van den Berg, I. Titov, and M. Welling, “Modeling Relational Data with Graph Convolutional Networks,” in ESWC, 2018, pp. 593–607. doi: 10.1007/978-3-319-93417-4_38.

X. Wang et al., “Heterogeneous Graph Attention Network,” in The World Wide Web Conference, New York, NY, USA: ACM, May 2019, pp. 2022–2032. doi: 10.1145/3308558.3313562.

Z. Hu, Y. Dong, K. Wang, and Y. Sun, “Heterogeneous Graph Transformer,” in Proceedings of The Web Conference 2020, New York, NY, USA: ACM, Apr. 2020, pp. 2704–2710. doi: 10.1145/3366423.3380027.

D. Xu, C. Ruan, E. Korpeoglu, S. Kumar, and K. Achan, “Inductive Representation Learning on Temporal Graphs,” Feb. 19, 2020. [Online]. Available: http://arxiv.org/abs/2002.07962

K. Xu, W. Hu, J. Leskovec, and S. Jegelka, “How Powerful are Graph Neural Networks?,” Feb. 22, 2019. [Online]. Available: http://arxiv.org/abs/1810.00826

Z. Chen, L. Chen, S. Villar, and J. Bruna, “Can Graph Neural Networks Count Substructures?,” in NeurIPS, 2020.

L. Breiman, “Random Forests,” Mach. Learn., vol. 45, no. 1, pp. 5–32, Oct. 2001, doi: 10.1023/A:1010933404324.

T. Chen and C. Guestrin, “XGBoost: A scalable tree boosting system,” in Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA: ACM, Aug. 2016, pp. 785–794. doi: 10.1145/2939672.2939785.

G. Ke et al., “LightGBM: A highly efficient gradient boosting decision tree,” in Advances in Neural Information Processing Systems, Long Beach, California, USA: Curran Associates, Inc., Dec. 2017, pp. 3149–3157.

S. Hochreiter and J. Schmidhuber, “Long Short-Term Memory,” Neural Comput., vol. 9, no. 8, pp. 1735–1780, Nov. 1997, doi: 10.1162/neco.1997.9.8.1735.

A. Vaswani et al., “Attention Is All You Need,” in Advances in Neural Information Processing Systems 30, Long Beach, California, USA: Curran Associates, Inc., Dec. 2017, pp. 5998–6008.

D. P. Kingma and M. Welling, “Auto-Encoding Variational Bayes,” in Proc. Int. Conf. Learn. Represent. (ICLR), 2014. [Online]. Available: http://arxiv.org/abs/1312.6114

T. N. Kipf and M. Welling, “Variational Graph Auto-Encoders,” Nov. 21, 2016. [Online]. Available: http://arxiv.org/abs/1611.07308

I. J. Goodfellow et al., “Generative Adversarial Nets,” in Advances in Neural Information Processing Systems 27, Montréal, Canada: Curran Associates, Inc., Dec. 2014, pp. 2672–2680.

N. D. Cao and T. Kipf, “MolGAN: An implicit generative model for small molecular graphs,” Sep. 27, 2018.

D. J. Rezende and S. Mohamed, “Variational Inference with Normalizing Flows,” Jun. 14, 2016. [Online]. Available: http://arxiv.org/abs/1505.05770

J. You, R. Ying, X. Ren, W. L. Hamilton, and J. Leskovec, “GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models,” Jun. 23, 2018. [Online]. Available: http://arxiv.org/abs/1802.08773

R. Liao et al., “Efficient Graph Generation with Graph Recurrent Attention Networks,” Jul. 17, 2020. [Online]. Available: http://arxiv.org/abs/1910.00760

J. Ho, A. Jain, and P. Abbeel, “Denoising Diffusion Probabilistic Models,” Dec. 16, 2020. [Online]. Available: http://arxiv.org/abs/2006.11239

Y. Song, J. Sohl-Dickstein, D. P. Kingma, A. Kumar, S. Ermon, and B. Poole, “Score-Based Generative Modeling through Stochastic Differential Equations,” Feb. 10, 2021. [Online]. Available: http://arxiv.org/abs/2011.13456

J. Gilmer, S. S. Schoenholz, P. F. Riley, O. Vinyals, and G. E. Dahl, “Neural Message Passing for Quantum Chemistry,” Int. Conf. Mach. Learn., Jun. 2017, [Online]. Available: http://arxiv.org/abs/1704.01212

T. N. Kipf and M. Welling, “Semi-Supervised Classification with Graph Convolutional Networks,” Feb. 22, 2017. [Online]. Available: http://arxiv.org/abs/1609.02907

W. L. Hamilton, R. Ying, and J. Leskovec, “Inductive Representation Learning on Large Graphs,” in Advances in Neural Information Processing Systems 30, Long Beach, California, USA: Curran Associates, Inc., Dec. 2017, pp. 1024–1034.

P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph Attention Networks,” in Proc. Int. Conf. Learn. Represent. (ICLR), 2018. [Online]. Available: http://arxiv.org/abs/1710.10903

Y. Dou, Z. Liu, L. Sun, Y. Deng, H. Peng, and P. S. Yu, “Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsters,” in Proceedings of the 29th ACM International Conference on Information & Knowledge Management, New York, NY, USA: ACM, Oct. 2020, pp. 315–324. doi: 10.1145/3340531.3411903.

Y. Liu et al., “Pick and Choose: A GNN-based Imbalanced Learning Approach for Fraud Detection,” in Proceedings of the Web Conference 2021, New York, NY, USA: ACM, Apr. 2021, pp. 3168–3177. doi: 10.1145/3442381.3449989.

A. Sankar, Y. Wu, L. Gou, W. Zhang, and H. Yang, “DYSAT: Deep Neural Representation Learning on Dynamic Graphs Via Self-Attention Networks,” in Proceedings of the 13th International Conference on Web Search and Data Mining, New York, NY, USA: ACM, Jan. 2020, pp. 519–527. doi: 10.1145/3336191.3371845.

A. Pareja et al., “EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs,” Proc. AAAI Conf. Artif. Intell., vol. 34, no. 04, pp. 5363–5370, Apr. 2020, doi: 10.1609/aaai.v34i04.5984.

E. Rossi, B. Chamberlain, F. Frasca, D. Eynard, F. Monti, and M. Bronstein, “Temporal Graph Networks for Deep Learning on Dynamic Graphs,” Oct. 09, 2020. [Online]. Available: http://arxiv.org/abs/2006.10637

Z. Liu, Y. Dou, P. S. Yu, Y. Deng, and H. Peng, “Alleviating the Inconsistency Problem of Applying Graph Neural Network to Fraud Detection,” in Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA: ACM, Jul. 2020, pp. 1569–1572. doi: 10.1145/3397271.3401253.

G. Zhang et al., “FRAUDRE: Fraud Detection Dual-Resistant to Graph Inconsistency and Imbalance,” in 2021 IEEE International Conference on Data Mining (ICDM), IEEE, Dec. 2021, pp. 867–876. doi: 10.1109/ICDM51629.2021.00098.

F. Shi, Y. Cao, Y. Shang, Y. Zhou, C. Zhou, and J. Wu, “H2-FDetector: A GNN-based Fraud Detector with Homophilic and Heterophilic Connections,” in Proceedings of the ACM Web Conference 2022, New York, NY, USA: ACM, Apr. 2022, pp. 1486–1494. doi: 10.1145/3485447.3512195.

Z. Liu, C. Chen, X. Yang, J. Zhou, X. Li, and L. Song, “Heterogeneous Graph Neural Networks for Malicious Account Detection,” in Proceedings of the 27th ACM International Conference on Information and Knowledge Management, New York, NY, USA: ACM, Oct. 2018, pp. 2077–2085. doi: 10.1145/3269206.3272010.

D. Wang et al., “A Semi-Supervised Graph Attentive Network for Financial Fraud Detection,” in 2019 IEEE International Conference on Data Mining (ICDM), IEEE, Nov. 2019, pp. 598–607. doi: 10.1109/ICDM.2019.00070.

G. Bouritsas, F. Frasca, S. Zafeiriou, and M. M. Bronstein, “Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting,” IEEE Trans. Pattern Anal. Mach. Intell., vol. 45, no. 1, pp. 657–668, Jan. 2023, doi: 10.1109/TPAMI.2022.3154319.

C. Bodnar et al., “Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks,” Jun. 14, 2021. [Online]. Available: http://arxiv.org/abs/2103.03212

Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, “A Comprehensive Survey on Graph Neural Networks,” IEEE Trans. Neural Networks Learn. Syst., vol. 32, no. 1, pp. 4–24, Jan. 2021, doi: 10.1109/TNNLS.2020.2978386.

J. Zhou et al., “Graph neural networks: A review of methods and applications,” AI Open, vol. 1, pp. 57–81, 2020, doi: 10.1016/j.aiopen.2021.01.001.

L. Sun et al., “Adversarial Attack and Defense on Graph Data: A Survey,” IEEE Trans. Knowl. Data Eng., pp. 1–20, 2022, doi: 10.1109/TKDE.2022.3201243.

Q. Li, Z. Han, and X. Wu, “Deeper Insights Into Graph Convolutional Networks for Semi-Supervised Learning,” Proc. AAAI Conf. Artif. Intell., vol. 32, no. 1, Apr. 2018, doi: 10.1609/aaai.v32i1.11604.

K. Xu, C. Li, Y. Tian, T. Sonobe, K. Kawarabayashi, and S. Jegelka, “Representation Learning on Graphs with Jumping Knowledge Networks,” Jun. 25, 2018. [Online]. Available: http://arxiv.org/abs/1806.03536

M. Chen, Z. Wei, Z. Huang, B. Ding, and Y. Li, “Simple and Deep Graph Convolutional Networks,” Jul. 04, 2020. [Online]. Available: http://arxiv.org/abs/2007.02133

Y. Rong, W. Huang, T. Xu, and J. Huang, “DropEdge: Towards Deep Graph Convolutional Networks on Node Classification,” Mar. 12, 2020. [Online]. Available: http://arxiv.org/abs/1907.10903

J. Gasteiger, A. Bojchevski, and S. Günnemann, “Predict then Propagate: Graph Neural Networks meet Personalized PageRank,” Apr. 05, 2022. [Online]. Available: http://arxiv.org/abs/1810.05997

J. Zhu, Y. Yan, L. Zhao, M. Heimann, L. Akoglu, and D. Koutra, “Beyond Homophily in Graph Neural Networks: Current Limitations and Effective Designs,” Oct. 23, 2020. [Online]. Available: http://arxiv.org/abs/2006.11468

S. Kumar, X. Zhang, and J. Leskovec, “Predicting Dynamic Embedding Trajectory in Temporal Interaction Networks,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, NY, USA: ACM, Jul. 2019, pp. 1269–1278. doi: 10.1145/3292500.3330895.

R. Trivedi, M. Farajtabar, P. Biswal, and H. Zha, “DyRep: Learning Representations over Dynamic Graphs,” in International Con-ference on Learning Representations, 2019.

Y. Wang, Y.-Y. Chang, Y. Liu, J. Leskovec, and P. Li, “Inductive Representation Learning in Temporal Networks via Causal Anonymous Walks,” Oct. 31, 2021. [Online]. Available: http://arxiv.org/abs/2101.05974

W. Cong et al., “Do We Really Need Complicated Model Architectures For Temporal Networks?,” Feb. 22, 2023. [Online]. Available: http://arxiv.org/abs/2302.11636

A. Souza, D. Mesquita, S. Kaski, and V. Garg, “Provably Expressive Temporal Graph Networks,” in Advances in Neural Information Processing Systems 35, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2022, pp. 32257–32269. doi: 10.52202/068431-2337.

S. Huang et al., “Temporal Graph Benchmark for Machine Learning on Temporal Graphs,” in Advances in Neural Information Processing Systems 36, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2023, pp. 2056–2073. doi: 10.52202/075280-0099.

S. M. Kazemi et al., “Representation Learning for Dynamic Graphs: A Survey,” Apr. 27, 2020. [Online]. Available: http://arxiv.org/abs/1905.11485

J. Skarding, B. Gabrys, and K. Musial, “Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey,” IEEE Access, vol. 9, pp. 79143–79168, 2021, doi: 10.1109/ACCESS.2021.3082932.

A. Longa et al., “Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunities,” Jul. 08, 2023. [Online]. Available: http://arxiv.org/abs/2302.01018

W. Jin, Y. Ma, X. Liu, X. Tang, S. Wang, and J. Tang, “Graph Structure Learning for Robust Graph Neural Networks,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, NY, USA: ACM, Aug. 2020, pp. 66–74. doi: 10.1145/3394486.3403049.

W. Jin, T. Zhao, J. Ding, Y. Liu, J. Tang, and N. Shah, “Empowering Graph Representation Learning with Test-Time Graph Transformation,” Feb. 26, 2023. [Online]. Available: http://arxiv.org/abs/2210.03561

E. Estrada and J. A. Rodríguez-Velázquez, “Subgraph centrality in complex networks,” Phys. Rev. E, vol. 71, no. 5, p. 056103, May 2005, doi: 10.1103/PhysRevE.71.056103.

R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon, “Network Motifs: Simple Building Blocks of Complex Networks,” Science, vol. 298, no. 5594, pp. 824–827, Oct. 2002, doi: 10.1126/science.298.5594.824.

A. R. Benson, D. F. Gleich, and J. Leskovec, “Higher-order organization of complex networks,” Science, vol. 353, no. 6295, pp. 163–166, Jul. 2016, doi: 10.1126/science.aad9029.

X. Zheng, B. Aragam, P. Ravikumar, and E. P. Xing, “DAGs with NO TEARS: Continuous Optimization for Structure Learning,” in NeurIPS, 2018, pp. 9492–9503.

Y. Yu, J. Chen, T. Gao, and M. Yu, “DAG-GNN: DAG Structure Learning with Graph Neural Networks,” Apr. 22, 2019. [Online]. Available: http://arxiv.org/abs/1904.10098

L. Akoglu, H. Tong, and D. Koutra, “Graph based anomaly detection and description: a survey,” Data Min. Knowl. Discov., vol. 29, no. 3, pp. 626–688, May 2015, doi: 10.1007/s10618-014-0365-y.

V. Chandola, A. Banerjee, and V. Kumar, “Anomaly detection,” ACM Comput. Surv., vol. 41, no. 3, pp. 1–58, Jul. 2009, doi: 10.1145/1541880.1541882.

K. Ding, J. Li, R. Bhanushali, and H. Liu, “Deep Anomaly Detection on Attributed Networks,” in Proceedings of the 2019 SIAM International Conference on Data Mining, Philadelphia, PA: Society for Industrial and Applied Mathematics, 2019, pp. 594–602. doi: 10.1137/1.9781611975673.67.

P. Veličković, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. D. Hjelm, “Deep Graph Infomax,” Dec. 21, 2018. [Online]. Available: http://arxiv.org/abs/1809.10341

Y. Liu, Z. Li, S. Pan, C. Gong, C. Zhou, and G. Karypis, “Anomaly Detection on Attributed Networks via Contrastive Self-Supervised Learning,” IEEE Trans. Neural Networks Learn. Syst., vol. 33, no. 6, pp. 2378–2392, Jun. 2022, doi: 10.1109/TNNLS.2021.3068344.

Y. Zheng, M. Jin, Y. Liu, L. Chi, K. T. Phan, and Y.-P. P. Chen, “Generative and Contrastive Self-Supervised Learning for Graph Anomaly Detection,” IEEE Trans. Knowl. Data Eng., vol. 35, no. 12, pp. 12220–12233, Dec. 2023, doi: 10.1109/TKDE.2021.3119326.

J. Duan et al., “Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented View,” Proc. AAAI Conf. Artif. Intell., vol. 37, no. 6, pp. 7459–7467, Jun. 2023, doi: 10.1609/aaai.v37i6.25907.

Y. Liu et al., “Graph Self-Supervised Learning: A Survey,” IEEE Trans. Knowl. Data Eng., pp. 1–1, 2022, doi: 10.1109/TKDE.2022.3172903.

Y. You, T. Chen, Y. Sui, T. Chen, Z. Wang, and Y. Shen, “Graph Contrastive Learning with Augmentations,” in Advances in Neural Information Processing Systems 33, Curran Associates, Inc., Dec. 2020, pp. 5812–5823.

J. Qiu et al., “GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training,” in Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, NY, USA: ACM, Aug. 2020, pp. 1150–1160. doi: 10.1145/3394486.3403168.

W. Hu et al., “Strategies for Pre-training Graph Neural Networks,” Feb. 18, 2020. [Online]. Available: http://arxiv.org/abs/1905.12265

J. Tang, J. Li, Z. Gao, and J. Li, “Rethinking Graph Neural Networks for Anomaly Detection,” May 31, 2022. [Online]. Available: http://arxiv.org/abs/2205.15508

Y. Gao, X. Wang, X. He, Z. Liu, H. Feng, and Y. Zhang, “Addressing Heterophily in Graph Anomaly Detection: A Perspective of Graph Spectrum,” in Proceedings of the ACM Web Conference 2023, New York, NY, USA: ACM, Apr. 2023, pp. 1528–1538. doi: 10.1145/3543507.3583268.

N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “SMOTE: Synthetic Minority Over-sampling Technique,” J. Artif. Intell. Res., vol. 16, pp. 321–357, Jun. 2002, doi: 10.1613/jair.953.

T. Zhao, X. Zhang, and S. Wang, “GraphSMOTE: Imbalanced Node Classification on Graphs with Graph Neural Networks,” in Proceedings of the 14th ACM International Conference on Web Search and Data Mining, New York, NY, USA: ACM, Mar. 2021, pp. 833–841. doi: 10.1145/3437963.3441720.

J. Park, J. Song, and E. Yang, “GraphENS: Neighbor-Aware Ego Network Synthesis for Class-Imbalanced Node Classification,” in ICLR, 2022.

T.-Y. Lin, P. Goyal, R. Girshick, K. He, and P. Dollar, “Focal Loss for Dense Object Detection,” in 2017 IEEE International Conference on Computer Vision (ICCV), Venice, Italy: IEEE, Oct. 2017, pp. 2999–3007. doi: 10.1109/ICCV.2017.324.

J. Sohl-Dickstein, E. Weiss, N. Maheswaranathan, and S. Ganguli, “Deep Unsupervised Learning using Nonequilibrium Thermodynamics,” in Proc. 32nd Int. Conf. Mach. Learn. (ICML), Lille, France: PMLR, Jul. 2015, pp. 2256–2265.

B. D. O. Anderson, “Reverse-time diffusion equation models,” Stoch. Process. their Appl., vol. 12, no. 3, pp. 313–326, May 1982, doi: 10.1016/0304-4149(82)90051-5.

A. Hyvärinen, “Estimation of Non-Normalized Statistical Models by Score Matching,” 2005.

P. Vincent, “A Connection Between Score Matching and Denoising Autoencoders,” Neural Comput., vol. 23, no. 7, pp. 1661–1674, Jul. 2011, doi: 10.1162/NECO_a_00142.

T. Karras, M. Aittala, T. Aila, and S. Laine, “Elucidating the Design Space of Diffusion-Based Generative Models,” in Advances in Neural Information Processing Systems 35, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2022, pp. 26565–26577. doi: 10.52202/068431-1926.

Y. Song and S. Ermon, “Generative Modeling by Estimating Gradients of the Data Distribution,” Oct. 10, 2020. [Online]. Available: http://arxiv.org/abs/1907.05600

J. Song, C. Meng, and S. Ermon, “Denoising Diffusion Implicit Models,” Oct. 05, 2022. [Online]. Available: http://arxiv.org/abs/2010.02502

C. Lu, Y. Zhou, F. Bao, J. Chen, C. Li, and J. Zhu, “DPM-Solver: A Fast ODE Solver for Diffusion Probabilistic Model Sampling in Around 10 Steps,” in Advances in Neural Information Processing Systems 35, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2022, pp. 5775–5787. doi: 10.52202/068431-0418.

P. Dhariwal and A. Nichol, “Diffusion Models Beat GANs on Image Synthesis,” Jun. 01, 2021. [Online]. Available: http://arxiv.org/abs/2105.05233

J. Ho and T. Salimans, “Classifier-Free Diffusion Guidance,” Jul. 26, 2022. [Online]. Available: http://arxiv.org/abs/2207.12598

C. Niu, Y. Song, J. Song, S. Zhao, A. Grover, and S. Ermon, “Permutation Invariant Graph Generation via Score-Based Generative Modeling,” in AISTATS, 2020, pp. 4474–4484.

J. Jo, S. Lee, and S. J. Hwang, “Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations,” in ICML, 2022, pp. 10362–10383.

C. Vignac, I. Krawczuk, A. Siraudin, B. Wang, V. Cevher, and P. Frossard, “DiGress: Discrete Denoising diffusion for graph generation,” May 23, 2023. [Online]. Available: http://arxiv.org/abs/2209.14734

K. K. Haefeli, K. Martinkus, N. Perraudin, and R. Wattenhofer, “Diffusion Models for Graphs Benefit From Discrete State Spaces,” Aug. 15, 2023. [Online]. Available: http://arxiv.org/abs/2210.01549

L. Kong, J. Cui, H. Sun, Y. Zhuang, B. A. Prakash, and C. Zhang, “Autoregressive Diffusion Model for Graph Generation,” Jul. 17, 2023. [Online]. Available: http://arxiv.org/abs/2307.08849

C. Liu et al., “Generative Diffusion Models on Graphs: Methods and Applications,” in Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, California: International Joint Conferences on Artificial Intelligence Organization, Aug. 2023, pp. 6702–6711. doi: 10.24963/ijcai.2023/751.

R. Rombach, A. Blattmann, D. Lorenz, P. Esser, and B. Ommer, “High-Resolution Image Synthesis with Latent Diffusion Models,” in 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Jun. 2022, pp. 10674–10685. doi: 10.1109/CVPR52688.2022.01042.

I. Alarab, S. Prakoonwit, and M. I. Nacer, “Comparative Analysis Using Supervised Learning Methods for Anti-Money Laundering in Bitcoin,” in Proceedings of the 2020 5th International Conference on Machine Learning Technologies, New York, NY, USA: ACM, Jun. 2020, pp. 11–17. doi: 10.1145/3409073.3409078.

J. Lorenz, M. I. Silva, D. Aparício, J. T. Ascensão, and P. Bizarro, “Machine learning methods to detect money laundering in the bitcoin blockchain in the presence of label scarcity,” in Proceedings of the First ACM International Conference on AI in Finance, New York, NY, USA: ACM, Oct. 2020, pp. 1–8. doi: 10.1145/3383455.3422549.

C. Oliveira, J. Torres, M. I. Silva, D. Aparício, J. T. Ascensão, and P. Bizarro, “GuiltyWalker: Distance to illicit nodes in the Bitcoin network,” Jul. 21, 2021. [Online]. Available: http://arxiv.org/abs/2102.05373

W. W. Lo, G. K. Kulatilleke, M. Sarhan, S. Layeghy, and M. Portmann, “Inspection-L: self-supervised GNN node embeddings for money laundering detection in bitcoin,” Appl. Intell., vol. 53, no. 16, pp. 19406–19417, Aug. 2023, doi: 10.1007/s10489-023-04504-9.

T. Suzumura and H. Kanezashi, “Anti-Money Laundering Datasets: AMLSim synthetic financial transaction generator,” 2021. [Online]. Available: https://github.com/IBM/AMLSim

E. Altman, J. Blanuša, L. von Niederhäusern, B. Egressy, A. Anghel, and K. Atasu, “Realistic Synthetic Financial Transactions for Anti-Money Laundering Models,” in Advances in Neural Information Processing Systems 36, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2023, pp. 29851–29874. doi: 10.52202/075280-1300.

B. Egressy, L. von Niederhäusern, J. Blanuša, E. Altman, R. Wattenhofer, and K. Atasu, “Provably Powerful Graph Neural Networks for Directed Multigraphs,” Proc. AAAI Conf. Artif. Intell., vol. 38, no. 10, pp. 11838–11846, Mar. 2024, doi: 10.1609/aaai.v38i10.29069.

M. Cardoso, P. Saleiro, and P. Bizarro, “LaundroGraph: Self-Supervised Graph Representation Learning for Anti-Money Laundering,” in Proceedings of the Third ACM International Conference on AI in Finance, New York, NY, USA: ACM, Nov. 2022, pp. 130–138. doi: 10.1145/3533271.3561727.

F. Johannessen and M. Jullum, “Finding money launderers using heterogeneous graph neural networks,” J. Financ. Data Sci., vol. 11, p. 100175, Dec. 2025, doi: 10.1016/j.jfds.2025.100175.

T. Suzumura, Y. Zhou, R. Kawahara, N. Baracaldo, and H. Ludwig, “Federated Learning for Collaborative Financial Crimes Detection,” in Federated Learning, Cham: Springer International Publishing, 2022, pp. 455–466. doi: 10.1007/978-3-030-96896-0_20.

D. Zügner, A. Akbarnejad, and S. Günnemann, “Adversarial Attacks on Neural Networks for Graph Data,” in Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, California: International Joint Conferences on Artificial Intelligence Organization, Aug. 2019, pp. 6246–6250. doi: 10.24963/ijcai.2019/872.

D. Zügner and S. Günnemann, “Adversarial Attacks on Graph Neural Networks via Meta Learning,” Jan. 28, 2024. [Online]. Available: http://arxiv.org/abs/1902.08412

H. Dai et al., “Adversarial Attack on Graph Structured Data,” Jun. 06, 2018. [Online]. Available: http://arxiv.org/abs/1806.02371

R. Ying, D. Bourgeois, J. You, M. Žitnik, and J. Leskovec, “GNNExplainer: Generating Explanations for Graph Neural Net-works,” PubMed, vol. 32, pp. 9240–9251, 2019.

D. Luo et al., “Parameterized Explainer for Graph Neural Network,” Nov. 09, 2020. [Online]. Available: http://arxiv.org/abs/2011.04573

H. Yuan, H. Yu, J. Wang, K. Li, and S. Ji, “On Explainability of Graph Neural Networks via Subgraph Explorations,” May 31, 2021. [Online]. Available: http://arxiv.org/abs/2102.05152

M. N. Vu and M. T. Thai, “PGM-Explainer: Probabilistic Graphical Model Explanations for Graph Neural Networks,” Oct. 12, 2020. [Online]. Available: http://arxiv.org/abs/2010.05788

P. E. Pope, S. Kolouri, M. Rostami, C. E. Martin, and H. Hoffmann, “Explainability Methods for Graph Convolutional Neural Networks,” in 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, Jun. 2019, pp. 10764–10773. doi: 10.1109/CVPR.2019.01103.

H. Yuan, H. Yu, S. Gui, and S. Ji, “Explainability in Graph Neural Networks: A Taxonomic Survey,” IEEE Trans. Pattern Anal. Mach. Intell., pp. 1–19, 2022, doi: 10.1109/TPAMI.2022.3204236.

S. X. Rao et al., “xFraud,” Proc. VLDB Endow., vol. 15, no. 3, pp. 427–436, Nov. 2021, doi: 10.14778/3494124.3494128.

C. Rudin, “Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead,” Nat. Mach. Intell., vol. 1, no. 5, pp. 206–215, May 2019, doi: 10.1038/s42256-019-0048-x.

A. Lučić, M. A. ter Hoeve, G. Tolomei, M. de Rijke, and F. Silvestri, “CF-GNNExplainer: Counterfactual Explanations for Graph Neural Networks,” in Proc. Int. Conf. Artif. Intell. Stat. (AISTATS), 2022, pp. 4499–4511.

W.-L. Chiang, X. Liu, S. Si, Y. Li, S. Bengio, and C.-J. Hsieh, “Cluster-GCN,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, New York, NY, USA: ACM, Jul. 2019, pp. 257–266. doi: 10.1145/3292500.3330925.

H. Zeng, H. Zhou, A. Srivastava, R. Kannan, and V. Prasanna, “GraphSAINT: Graph Sampling Based Inductive Learning Method,” Feb. 16, 2020. [Online]. Available: http://arxiv.org/abs/1907.04931

H. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y Arcas, “Communication-Efficient Learning of Deep Networks from Decentralized Data,” Jan. 26, 2023. [Online]. Available: http://arxiv.org/abs/1602.05629

P. Kairouz and H. B. McMahan, “Advances and Open Problems in Federated Learning,” Found. Trends® Mach. Learn., vol. 14, no. 1–2, pp. 1–210, Jun. 2021, doi: 10.1561/2200000083.

C. Dwork and A. Roth, The Algorithmic Foundations of Differential Privacy. now Publishers Inc, 2013. doi: 10.1561/9781601988195.

W. Hu et al., “Open Graph Benchmark: Datasets for Machine Learning on Graphs,” Feb. 25, 2021. [Online]. Available: http://arxiv.org/abs/2005.00687

K. Liu et al., “BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs,” in Advances in Neural Information Processing Systems 35, San Diego, California, USA: Neural Information Processing Systems Foundation, Inc. (NeurIPS), 2022, pp. 27021–27035. doi: 10.52202/068431-1959.

Y. Elmougy and L. Liu, “Demystifying Fraudulent Transactions and Illicit Nodes in the Bitcoin Network for Financial Forensics,” in Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, New York, NY, USA: ACM, Aug. 2023, pp. 3979–3990. doi: 10.1145/3580305.3599803.

C. Bellei et al., “The Shape of Money Laundering: Subgraph Representation Learning on the Blockchain with the Elliptic2 Dataset,” Jul. 29, 2024. [Online]. Available: http://arxiv.org/abs/2404.19109

J. Davis and M. Goadrich, “The relationship between Precision-Recall and ROC curves,” in Proceedings of the 23rd international conference on Machine learning - ICML ’06, New York, New York, USA: ACM Press, 2006, pp. 233–240. doi: 10.1145/1143844.1143874.

T. Saito and M. Rehmsmeier, “The Precision-Recall Plot Is More Informative than the ROC Plot When Evaluating Binary Classifiers on Imbalanced Datasets,” PLoS One, vol. 10, no. 3, p. e0118432, Mar. 2015, doi: 10.1371/journal.pone.0118432.

C. Guo, G. Pleiss, Y. Sun, and K. Q. Weinberger, “On Calibration of Modern Neural Networks,” Aug. 03, 2017, PMLR. doi: 10.48550/arXiv.1706.04599.

Downloads

Published

2026-11-17

How to Cite

Ale, D. T., Ogunti, E. O., Oyetunji, S. A., Ponnle, A. A., & Adedeji, K. B. (2026). Graph-Based Financial Fraud Detection: A Property-Centric Survey of Static, Temporal, Cycle-Aware, and Generative Methods and Their Evaluation. Journal of Computing Theories and Applications, 4(2), 790–824. https://doi.org/10.62411/jcta.18143