TMR-GGNN: Credit Card Fraud Detection based on Time-Aware Multi-Relational Guided Graph Neural Network
Summary
Proposes TMR-GGNN, a time-aware multi-relational graph neural network for credit card fraud detection that handles imbalanced data and evolving fraud patterns via contrastive learning and focal loss.
View Cached Full Text
Cached at: 06/18/26, 05:42 AM
# TMR-GGNN: Credit Card Fraud Detection based on Time-Aware Multi-Relational Guided Graph Neural Network Source: [https://arxiv.org/abs/2606.18444](https://arxiv.org/abs/2606.18444) [View PDF](https://arxiv.org/pdf/2606.18444) > Abstract:In recent years, credit card fraud detection has faced significant challenges due to highly imbalanced data, evolving fraud patterns, and complex relational structures among transaction entities\. To address these issues, this research proposes a novel framework called Timeaware Multi Relational Guided Graph Neural Network \(TMR GGNN\)\. Particularly, the proposed TMR GGNN extends the encoder decoder Graph Neural Network GNN architecture by modeling heterogeneous interactions across customers, merchants, devices, and IPs over temporal windows\. Subsequently, the proposed TMR GGNN approach constructs a dynamic, multi relational graph and incorporates a time aware relational attention mechanism within the encoder to adaptively weigh the transaction relevance based on temporal proximity and semantic context\. Consequently, the decoder employs a contrastive learning module to distinguish between real and synthesized transaction patterns, while improving the models generalization of rare fraud cases\. Additionally, to effectively manage severe class imbalances and emphasize discriminative learning, a composite loss function combining Information Noise Contrastive Estimation \(InfoNCE\) based contrastive loss with Focal Loss is introduced\. This integration assists in improving fraud identification while mitigating false negatives\. ## Submission history From: Navin Chhibber \[[view email](https://arxiv.org/show-email/2e9f9051/2606.18444)\] **\[v1\]**Tue, 16 Jun 2026 19:50:53 UTC \(402 KB\)
Similar Articles
Graph-Based Financial Fraud Detection with Calibrated Risk Scoring and Structural Regularization
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.
Quantum-Inspired Contextual Learning for Sparse-Ring Fraud Detection in Dynamic Transaction Graphs
This paper presents an exploratory benchmark for detecting sparse-ring fraud in dynamic transaction graphs using quantum-inspired Contextual Machine Learning (CML) compared to a GRU baseline, finding that hybrid graph features combining identity-preserving and topological summaries yield the best results.
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.
Multi-Stream Temporal Fusion for Financial Fraud Detection
Proposes the Multi-Stream Fraud Transformer (MSFT) for financial fraud detection, which independently encodes transaction, login, and risk event streams using Transformers and fuses them with time-aware positional encoding and gated fusion, achieving 0.9961 AUROC on a large dataset.
SALT-GNN: Handling Dense Neighborhoods in Anti-Money Laundering Graphs via Statistics-Aware Attention
This paper introduces SALT-GNN, a statistics-aware GNN architecture that fuses degree-aware statistical aggregation with attention to handle dense neighborhoods in anti-money laundering graphs, achieving improved F1 scores on dense recipient contexts with fewer parameters.