mlsanityData to 14 Oct 2026

Dual-channel Heterophilic Message Passing for Graph Fraud Detection

arXiv 2504.14205 ↗First posted 19 Apr 2025cs.LG cs.AIcited by 8

Not on the map. Why?

Abstract (arXiv)

Fraudulent activities have significantly increased across various domains, such as e-commerce, online review platforms, and social networks, making fraud detection a critical task. Spatial Graph Neural Networks (GNNs) have been successfully applied to fraud detection tasks due to their strong inductive learning capabilities. However, existing spatial GNN-based methods often enhance the graph structure by excluding heterophilic neighbors during message passing to align with the homophilic bias of GNNs. Unfortunately, this approach can disrupt the original graph topology and increase uncertainty in predictions. To address these limitations, this paper proposes a novel framework, Dual-channel Heterophilic Message Passing (DHMP), for fraud detection. DHMP leverages a heterophily separation module to divide the graph into homophilic and heterophilic subgraphs, mitigating the low-pass inductive bias of traditional GNNs. It then applies shared weights to capture signals at different frequencies independently and incorporates a customized sampling strategy for training. This allows nodes to adaptively balance the contributions of various signals based on their labels. Extensive experiments on three real-world datasets demonstrate that DHMP outperforms existing methods, highlighting the importance of separating signals with different frequencies for improved fraud detection. The code is available at https://github.com/shaieesss/DHMP.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 8 of its 17 references that are in the map. First posted on arXiv 19 Apr 2025.

Builds on

8 of 17 references.

References · 8

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  4. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  5. 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 362
  6. 2020Enhancing Graph Neural Network-based Fraud Detectors against Camouflaged Fraudsterscited by 250
  7. 2022Rethinking Graph Neural Networks for Anomaly Detectioncited by 187
  8. 2024SEFraud: Graph-based Self-Explainable Fraud Detection via Interpretative Mask Learningcited by 12

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 6; 2026: 2.

8 papers.