DynBERG: Dynamic BERT-based Graph neural network for financial fraud detection

• URL: http://arxiv.org/abs/2511.00047v1
• Date: Tue, 28 Oct 2025 10:31:39 GMT
• Title: DynBERG: Dynamic BERT-based Graph neural network for financial fraud detection
• Authors: Omkar Kulkarni, Rohitash Chandra,
• Abstract summary: We introduce DynBERG, a novel architecture that integrates Graph-BERT with a Gated Recurrent Unit (GRU) layer to capture temporal evolution over multiple time steps.<n>We evaluate our model on the Elliptic dataset, which includes Bitcoin transactions, including all transactions during a major cryptocurrency market event, the Dark Market Shutdown.
• Score: 3.8271803328378677
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Financial fraud detection is critical for maintaining the integrity of financial systems, particularly in decentralised environments such as cryptocurrency networks. Although Graph Convolutional Networks (GCNs) are widely used for financial fraud detection, graph Transformer models such as Graph-BERT are gaining prominence due to their Transformer-based architecture, which mitigates issues such as over-smoothing. Graph-BERT is designed for static graphs and primarily evaluated on citation networks with undirected edges. However, financial transaction networks are inherently dynamic, with evolving structures and directed edges representing the flow of money. To address these challenges, we introduce DynBERG, a novel architecture that integrates Graph-BERT with a Gated Recurrent Unit (GRU) layer to capture temporal evolution over multiple time steps. Additionally, we modify the underlying algorithm to support directed edges, making DynBERG well-suited for dynamic financial transaction analysis. We evaluate our model on the Elliptic dataset, which includes Bitcoin transactions, including all transactions during a major cryptocurrency market event, the Dark Market Shutdown. By assessing DynBERG's resilience before and after this event, we analyse its ability to adapt to significant market shifts that impact transaction behaviours. Our model is benchmarked against state-of-the-art dynamic graph classification approaches, such as EvolveGCN and GCN, demonstrating superior performance, outperforming EvolveGCN before the market shutdown and surpassing GCN after the event. Additionally, an ablation study highlights the critical role of incorporating a time-series deep learning component, showcasing the effectiveness of GRU in modelling the temporal dynamics of financial transactions.

Related papers

• Detecting Credit Card Fraud via Heterogeneous Graph Neural Networks with Graph Attention [2.7002727600755883]
  This study proposes a credit card fraud detection method based on Heterogeneous Graph Neural Network (HGNN)<n>By leveraging graph neural networks, the model captures higher-order transaction relationships.<n>The model achieves notable improvements in both accuracy and OC-ROC.
  arXiv  Detail & Related papers  (2025-04-11T00:53:53Z)
• Revisiting Graph Neural Networks on Graph-level Tasks: Comprehensive Experiments, Analysis, and Improvements [54.006506479865344]
  We propose a unified evaluation framework for graph-level Graph Neural Networks (GNNs)<n>This framework provides a standardized setting to evaluate GNNs across diverse datasets.<n>We also propose a novel GNN model with enhanced expressivity and generalization capabilities.
  arXiv  Detail & Related papers  (2025-01-01T08:48:53Z)
• Exact Certification of (Graph) Neural Networks Against Label Poisoning [50.87615167799367]
  We introduce an exact certification method for label flipping in Graph Neural Networks (GNNs)<n>We apply our method to certify a broad range of GNN architectures in node classification tasks.<n>Our work presents the first exact certificate to a poisoning attack ever derived for neural networks.
  arXiv  Detail & Related papers  (2024-11-30T17:05:12Z)
• Conditional Forecasting of Margin Calls using Dynamic Graph Neural Networks [0.0]
  We introduce a novel Dynamic Graph Neural Network architecture for solving conditional $m$-steps ahead forecasting problems in temporal financial networks. Our work shows that the network dynamics can be successfully incorporated into stress-testing practices, thus providing regulators and policymakers with a crucial tool for systemic risk monitoring.
  arXiv  Detail & Related papers  (2024-10-30T17:55:41Z)
• Provable Robustness of (Graph) Neural Networks Against Data Poisoning and Backdoor Attacks [50.87615167799367]
  We certify Graph Neural Networks (GNNs) against poisoning attacks, including backdoors, targeting the node features of a given graph.<n>Our framework provides fundamental insights into the role of graph structure and its connectivity on the worst-case behavior of convolution-based and PageRank-based GNNs.
  arXiv  Detail & Related papers  (2024-07-15T16:12:51Z)
• Dynamic Graph Unlearning: A General and Efficient Post-Processing Method via Gradient Transformation [24.20087360102464]
  We study the dynamic graph unlearning for the first time and propose an effective, efficient, general, and post-processing method to implement DGNN unlearning.<n>Our method has the potential to handle future unlearning requests with significant performance gains.
  arXiv  Detail & Related papers  (2024-05-23T10:26:18Z)
• Temporal Graph Networks for Graph Anomaly Detection in Financial Networks [28.353194998824538]
  This paper explores the utilization of Temporal Graph Networks (TGN) for financial anomaly detection. We compare TGN's performance against static Graph Network (GNN) baselines, as well as cutting-edge hypergraph neural network baselines. Our results demonstrate that TGN significantly outperforms other models in terms of AUC metrics.
  arXiv  Detail & Related papers  (2024-03-27T07:17:16Z)
• Temporal and Heterogeneous Graph Neural Network for Financial Time Series Prediction [14.056579711850578]
  We propose a temporal and heterogeneous graph neural network-based (THGNN) approach to learn the dynamic relations among price movements in financial time series. We conduct extensive experiments on the stock market in the United States and China.
  arXiv  Detail & Related papers  (2023-05-09T11:17:46Z)
• MentorGNN: Deriving Curriculum for Pre-Training GNNs [61.97574489259085]
  We propose an end-to-end model named MentorGNN that aims to supervise the pre-training process of GNNs across graphs. We shed new light on the problem of domain adaption on relational data (i.e., graphs) by deriving a natural and interpretable upper bound on the generalization error of the pre-trained GNNs.
  arXiv  Detail & Related papers  (2022-08-21T15:12:08Z)
• EvenNet: Ignoring Odd-Hop Neighbors Improves Robustness of Graph Neural Networks [51.42338058718487]
  Graph Neural Networks (GNNs) have received extensive research attention for their promising performance in graph machine learning. Existing approaches, such as GCN and GPRGNN, are not robust in the face of homophily changes on test graphs. We propose EvenNet, a spectral GNN corresponding to an even-polynomial graph filter.
  arXiv  Detail & Related papers  (2022-05-27T10:48:14Z)
• BScNets: Block Simplicial Complex Neural Networks [79.81654213581977]
  Simplicial neural networks (SNN) have recently emerged as the newest direction in graph learning. We present Block Simplicial Complex Neural Networks (BScNets) model for link prediction. BScNets outperforms state-of-the-art models by a significant margin while maintaining low costs.
  arXiv  Detail & Related papers  (2021-12-13T17:35:54Z)
• Graph Backdoor [53.70971502299977]
  We present GTA, the first backdoor attack on graph neural networks (GNNs) GTA departs in significant ways: it defines triggers as specific subgraphs, including both topological structures and descriptive features. It can be instantiated for both transductive (e.g., node classification) and inductive (e.g., graph classification) tasks.
  arXiv  Detail & Related papers  (2020-06-21T19:45:30Z)
• Linking Bank Clients using Graph Neural Networks Powered by Rich Transactional Data [2.1169216065483996]
  We propose a new graph neural network model, which uses not only the topological structure of the network but rich time-series data available for the graph nodes and edges. The proposed model outperforms the existing approaches, with a significant gap in ROC AUC score on link prediction problem and also allows to improve the quality of credit scoring.
  arXiv  Detail & Related papers  (2020-01-23T10:02:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.