mlsanityData to 7 Oct 2026

The Devil is in the Conflict: Disentangled Information Graph Neural Networks for Fraud Detection

arXiv 2210.12384 ↗First posted 22 Oct 2022cs.LG cs.AI cs.SIcited by 11

Not on the map. Why?

Abstract (arXiv)

Graph-based fraud detection has heretofore received considerable attention. Owning to the great success of Graph Neural Networks (GNNs), many approaches adopting GNNs for fraud detection has been gaining momentum. However, most existing methods are based on the strong inductive bias of homophily, which indicates that the context neighbors tend to have same labels or similar features. In real scenarios, fraudsters often engage in camouflage behaviors in order to avoid detection system. Therefore, the homophilic assumption no longer holds, which is known as the inconsistency problem. In this paper, we argue that the performance degradation is mainly attributed to the inconsistency between topology and attribute. To address this problem, we propose to disentangle the fraud network into two views, each corresponding to topology and attribute respectively. Then we propose a simple and effective method that uses the attention mechanism to adaptively fuse two views which captures data-specific preference. In addition, we further improve it by introducing mutual information constraints for topology and attribute. To this end, we propose a Disentangled Information Graph Neural Network (DIGNN) model, which utilizes variational bounds to find an approximate solution to our proposed optimization objective function. Extensive experiments demonstrate that our model can significantly outperform stateof-the-art baselines on real-world fraud detection datasets.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 21 of its 39 references that are in the map. First posted on arXiv 22 Oct 2022.

Builds on

21 of 39 references.

References · 21

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  4. 2017Graph Attention Networkscited by 8,854
  5. 2017Inductive Representation Learning on Large Graphscited by 6,284
  6. 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
  7. 2018MINE: Mutual Information Neural Estimationcited by 680
  8. 2021Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methodscited by 309
  9. 2019Revisiting Graph Neural Networks: All We Have is Low-Pass Filterscited by 260
  10. 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 248
  11. 2021A Comprehensive Survey on Graph Anomaly Detection with Deep Learningcited by 230
  12. 2020Learning Robust Representations via Multi-View Information Bottleneckcited by 189
9 more
  1. 2020A Semi-supervised Graph Attentive Network for Financial Fraud Detectioncited by 150
  2. 2020AM-GCN: Adaptive Multi-channel Graph Convolutional Networkscited by 121
  3. 2020A Unified View on Graph Neural Networks as Graph Signal Denoisingcited by 110
  4. 2013From Amateurs to Connoisseurs: Modeling the Evolution of User Expertise through Online Reviewscited by 107
  5. 2020Alleviating the Inconsistency Problem of Applying Graph Neural Network to Fraud Detectioncited by 81
  6. 2021User Preference-aware Fake News Detectioncited by 76
  7. 2019Spam Review Detection with Graph Convolutional Networkscited by 57
  8. 2021Self-supervised Consensus Representation Learning for Attributed Graphcited by 15
  9. 2021Disentangled Variational Information Bottleneck for Multiview Representation Learningcited by 8

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 5; 2025: 3; 2026: 1.

11 papers.