Grad: Guided Relation Diffusion Generation for Graph Augmentation in Graph Fraud Detection

• URL: http://arxiv.org/abs/2512.18133v1
• Date: Fri, 19 Dec 2025 23:32:36 GMT
• Title: Grad: Guided Relation Diffusion Generation for Graph Augmentation in Graph Fraud Detection
• Authors: Jie Yang, Rui Zhang, Ziyang Cheng, Dawei Cheng, Guang Yang, Bo Wang,
• Abstract summary: Fraudsters disguise themselves by mimicking the behavioral data collected by platforms.<n>This narrows the differences in behavioral traits between them and benign users within the platform's database.<n>To address this problem, we propose a relation diffusion-based graph augmentation model Grad.
• Score: 34.04981707677924
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nowadays, Graph Fraud Detection (GFD) in financial scenarios has become an urgent research topic to protect online payment security. However, as organized crime groups are becoming more professional in real-world scenarios, fraudsters are employing more sophisticated camouflage strategies. Specifically, fraudsters disguise themselves by mimicking the behavioral data collected by platforms, ensuring that their key characteristics are consistent with those of benign users to a high degree, which we call Adaptive Camouflage. Consequently, this narrows the differences in behavioral traits between them and benign users within the platform's database, thereby making current GFD models lose efficiency. To address this problem, we propose a relation diffusion-based graph augmentation model Grad. In detail, Grad leverages a supervised graph contrastive learning module to enhance the fraud-benign difference and employs a guided relation diffusion generator to generate auxiliary homophilic relations from scratch. Based on these, weak fraudulent signals would be enhanced during the aggregation process, thus being obvious enough to be captured. Extensive experiments have been conducted on two real-world datasets provided by WeChat Pay, one of the largest online payment platforms with billions of users, and three public datasets. The results show that our proposed model Grad outperforms SOTA methods in both various scenarios, achieving at most 11.10% and 43.95% increases in AUC and AP, respectively. Our code is released at https://github.com/AI4Risk/antifraud and https://github.com/Muyiiiii/WWW25-Grad.

Related papers

• Inductive inference of gradient-boosted decision trees on graphs for insurance fraud detection [5.0564566972893505]
  We present a novel inductive graph gradient boosting machine (G-GBM) for supervised learning on heterogeneous and dynamic graphs.<n>We show that our estimator competes with popular graph neural network approaches in an experiment using a variety of simulated random graphs.
  arXiv  Detail & Related papers  (2025-10-07T08:35:12Z)
• Effective High-order Graph Representation Learning for Credit Card Fraud Detection [11.174026504498931]
  Fraudsters often disguise their crimes by using legitimate transactions through several benign users to bypass anti-fraud detection.<n>Existing graph neural network (GNN) models struggle with learning features of camouflaged, indirect multi-hop transactions.<n>We propose a novel High-order Graph Representation Learning model (HOGRL) to avoid incorporating excessive noise during the multi-layer aggregation process.
  arXiv  Detail & Related papers  (2025-03-03T13:59:46Z)
• A Label-Free Heterophily-Guided Approach for Unsupervised Graph Fraud Detection [60.09453163562244]
  We propose a Heterophily-guided Unsupervised Graph fraud dEtection approach (HUGE) for unsupervised GFD.<n>In the estimation module, we design a novel label-free heterophily metric called HALO, which captures the critical graph properties for GFD.<n>In the alignment-based fraud detection module, we develop a joint-GNN architecture with ranking loss and asymmetric alignment loss.
  arXiv  Detail & Related papers  (2025-02-18T22:07:36Z)
• Graph Transductive Defense: a Two-Stage Defense for Graph Membership Inference Attacks [50.19590901147213]
  Graph neural networks (GNNs) have become instrumental in diverse real-world applications, offering powerful graph learning capabilities. GNNs are vulnerable to adversarial attacks, including membership inference attacks (MIA) This paper proposes an effective two-stage defense, Graph Transductive Defense (GTD), tailored to graph transductive learning characteristics.
  arXiv  Detail & Related papers  (2024-06-12T06:36:37Z)
• 2SFGL: A Simple And Robust Protocol For Graph-Based Fraud Detection [1.6427658855248812]
  We propose a novel two-stage approach to federated graph learning (2SFGL) 2SFGL involves the virtual fusion of multiparty graphs, and the second involves model training and inference on the virtual graph. We evaluate our framework on a conventional fraud detection task based on the FraudAmazonDataset and FraudYelpDataset.
  arXiv  Detail & Related papers  (2023-10-12T13:48:26Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• The Devil is in the Conflict: Disentangled Information Graph Neural Networks for Fraud Detection [17.254383007779616]
  We argue that the performance degradation is mainly attributed to the inconsistency between topology and attribute. We propose a simple and effective method that uses the attention mechanism to adaptively fuse two views. Our model can significantly outperform stateof-the-art baselines on real-world fraud detection datasets.
  arXiv  Detail & Related papers  (2022-10-22T08:21:49Z)
• Deep Fraud Detection on Non-attributed Graph [61.636677596161235]
  Graph Neural Networks (GNNs) have shown solid performance on fraud detection. labeled data is scarce in large-scale industrial problems, especially for fraud detection. We propose a novel graph pre-training strategy to leverage more unlabeled data.
  arXiv  Detail & Related papers  (2021-10-04T03:42:09Z)
• Relational Graph Neural Networks for Fraud Detection in a Super-App environment [53.561797148529664]
  We propose a framework of relational graph convolutional networks methods for fraudulent behaviour prevention in the financial services of a Super-App. We use an interpretability algorithm for graph neural networks to determine the most important relations to the classification task of the users. Our results show that there is an added value when considering models that take advantage of the alternative data of the Super-App and the interactions found in their high connectivity.
  arXiv  Detail & Related papers  (2021-07-29T00:02:06Z)

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.