Graph-Based Financial Fraud Detection with Calibrated Risk Scoring and Structural Regularization
Summary
This paper proposes a graph neural network framework for financial fraud detection that integrates transaction records and identity information into node attributes, employs a multi-layer message passing mechanism, and uses weighted supervision and structural consistency regularization to improve risk scoring and probability calibration. Experiments on a public dataset show the method outperforms existing approaches.
View Cached Full Text
Cached at: 05/14/26, 06:18 AM
# Graph-Based Financial Fraud Detection with Calibrated Risk Scoring and Structural Regularization Source: [https://arxiv.org/abs/2605.12782](https://arxiv.org/abs/2605.12782) [View PDF](https://arxiv.org/pdf/2605.12782) > Abstract:Financial transaction fraud prevention faces challenges such as complex relationship structures, concealed behavioral patterns, and dynamically changing data distribution\. Discrimination models relying solely on independent sample features are insufficient to fully characterize the risks of group collaboration and chain transfers within transaction networks\. This paper proposes a graph neural network representation learning and risk discrimination framework for financial transaction fraud prevention\. It integrates transaction records and identity information into node attributes and constructs a transaction graph based on shared attributes and interaction consistency to explicitly model inter\-transaction relationships\. In model design, a multi\-layer message passing mechanism is employed to aggregate neighborhood information, learn node embedding representations containing structural context semantics, and output transaction\-level fraud probability and risk scores through a lightweight risk discrimination head\. A weighted supervision objective is introduced to mitigate training bias caused by class imbalance, and structural consistency regularization constraints are combined to suppress the impact of noisy edges on representation drift, thereby improving the stability and usability of risk characterization\. Experiments are conducted on a publicly available financial transaction dataset, comparing various methods in the same direction and comprehensively evaluating them under a unified evaluation protocol\. The results show that the proposed method outperforms other methods in risk ranking and probability calibration quality, validating the effectiveness of graph structure modeling and representation learning collaboration in financial transaction fraud prevention\. ## Submission history From: Yuhan Wang \[[view email](https://arxiv.org/show-email/b0453833/2605.12782)\] **\[v1\]**Tue, 12 May 2026 21:52:24 UTC \(1,086 KB\)
Similar Articles
Graph-Driven Cross-Industry Real-Time Monitoring Framework for Anti-Money Laundering Detection in Converged Mobility-Energy Supply Chain Networks
This paper proposes a graph-driven real-time anti-money laundering monitoring framework (GCRMF) for cross-industry supply chain networks, leveraging heterogeneous graphs and temporal attention networks, achieving over 17.8% F1 improvement.
Robustness of Graph Self-Supervised Learning to Real-World Noise: A Case Study on Text-Driven Biomedical Graphs
This paper introduces NATD-GSSL, a framework evaluating the robustness of Graph Self-Supervised Learning on noisy, text-driven biomedical graphs. It demonstrates that certain GNN architectures and pretext tasks maintain performance despite real-world noise, offering practical guidance for unsupervised learning in imperfect datasets.
Adversarial Graph Neural Network Benchmarks: Towards Practical and Fair Evaluation
This paper presents a comprehensive benchmark for evaluating adversarial attacks and defenses in Graph Neural Networks, highlighting the need for standardized and fair experimental protocols.
Automated Big Data Quality Assessment using Knowledge Graph Embeddings
This paper introduces a knowledge-based approach using knowledge graph embeddings to automatically assess big data quality by predicting missing edges between context representations and quality rules, outperforming traditional matching methods.
Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation
This paper introduces HMH, a hierarchical multi-scale Graph Neural Network framework designed to address oversmoothing and oversquashing in heterophilous graphs. It utilizes spectral filters with Haar bases to achieve scalable learning and improved performance on node and graph classification tasks.