mlsanityData to 14 Oct 2026

BRIGHT -- Graph Neural Networks in Real-Time Fraud Detection

arXiv 2205.13084 ↗First posted 25 May 2022cs.LG cs.AIcited by 15

Not on the map. Why?

Abstract (arXiv)

Detecting fraudulent transactions is an essential component to control risk in e-commerce marketplaces. Apart from rule-based and machine learning filters that are already deployed in production, we want to enable efficient real-time inference with graph neural networks (GNNs), which is useful to catch multihop risk propagation in a transaction graph. However, two challenges arise in the implementation of GNNs in production. First, future information in a dynamic graph should not be considered in message passing to predict the past. Second, the latency of graph query and GNN model inference is usually up to hundreds of milliseconds, which is costly for some critical online services. To tackle these challenges, we propose a Batch and Real-time Inception GrapH Topology (BRIGHT) framework to conduct an end-to-end GNN learning that allows efficient online real-time inference. BRIGHT framework consists of a graph transformation module (Two-Stage Directed Graph) and a corresponding GNN architecture (Lambda Neural Network). The Two-Stage Directed Graph guarantees that the information passed through neighbors is only from the historical payment transactions. It consists of two subgraphs representing historical relationships and real-time links, respectively. The Lambda Neural Network decouples inference into two stages: batch inference of entity embeddings and real-time inference of transaction prediction. Our experiments show that BRIGHT outperforms the baseline models by >2% in average w.r.t.~precision. Furthermore, BRIGHT is computationally efficient for real-time fraud detection. Regarding end-to-end performance (including neighbor query and inference), BRIGHT can reduce the P99 latency by >75%. For the inference stage, our speedup is on average 7.8× compared to the traditional GNN.

Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). Builds on 21 of its 34 references that are in the map. First posted on arXiv 25 May 2022.

Builds on

21 of 34 references.

References · 21

  1. 2017Attention Is All You Needcited by 60,361
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  3. 2017Graph Attention Networkscited by 8,923
  4. 2017Inductive Representation Learning on Large Graphscited by 6,320
  5. 2021Revisiting Deep Learning Models for Tabular Datacited by 740
  6. 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
  7. 2020Heterogeneous Graph Transformercited by 582
  8. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
  9. 2019DeepGCNs: Can GCNs Go as Deep as CNNs?cited by 527
  10. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
  11. 2021Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networkscited by 176
  12. 2021Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillationcited by 152
9 more
  1. 2019Diachronic Embedding for Temporal Knowledge Graph Completioncited by 104
  2. 2020APAN: Asynchronous Propagation Attention Network for Real-time Temporal Graph Embeddingcited by 78
  3. 2021Accelerating Large Scale Real-Time GNN Inference using Channel Pruningcited by 41
  4. 2020xFraud: Explainable Fraud Transaction Detectioncited by 28
  5. 2021Cross-Batch Negative Sampling for Training Two-Tower Recommenderscited by 24
  6. 2019TitAnt: Online Real-time Transaction Fraud Detection in Ant Financialcited by 10
  7. 2020Suspicious Massive Registration Detection via Dynamic Heterogeneous Graph Neural Networkscited by 6
  8. 2022Modelling graph dynamics in fraud detection with "Attention"cited by 5
  9. 2021Exploring Heterogeneous Metadata for Video Recommendation with Two-tower Modelcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 7; 2024: 4; 2025: 2; 2026: 2.

15 papers.

Sort: