dhmp
Dual-channel Heterophilic Message Passing for Graph Fraud Detection
Zhang, Wenxin, Zhong, Jingxing, Yao, Guangzhen, Han, Renda, Lin, Xiaojian, Zhang, Zeyu, Luo, Cuicui
--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. T o 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.
- Asia > China > Beijing > Beijing (0.04)
- Asia > China > Fujian Province > Fuzhou (0.04)
- Oceania > Australia > Australian Capital Territory > Canberra (0.04)
- (2 more...)
- Law Enforcement & Public Safety > Fraud (1.00)
- Information Technology (1.00)
Discovering Message Passing Hierarchies for Mesh-Based Physics Simulation
Deng, Huayu, Zhu, Xiangming, Wang, Yunbo, Yang, Xiaokang
Graph neural networks have emerged as a powerful tool for large-scale mesh-based physics simulation. Existing approaches primarily employ hierarchical, multi-scale message passing to capture long-range dependencies within the graph. However, these graph hierarchies are typically fixed and manually designed, which do not adapt to the evolving dynamics present in complex physical systems. In this paper, we introduce a novel neural network named DHMP, which learns Dynamic Hierarchies for Message Passing networks through a differentiable node selection method. The key component is the anisotropic message passing mechanism, which operates at both intra-level and inter-level interactions. Unlike existing methods, it first supports directionally non-uniform aggregation of dynamic features between adjacent nodes within each graph hierarchy. Second, it determines node selection probabilities for the next hierarchy according to different physical contexts, thereby creating more flexible message shortcuts for learning remote node relations. Our experiments demonstrate the effectiveness of DHMP, achieving 22.7% improvement on average compared to recent fixed-hierarchy message passing networks across five classic physics simulation datasets. Simulating physical systems with deep neural networks has achieved remarkable success due to their efficiency compared with traditional numerical solvers. Graph Neural Networks (GNNs) have been validated as a powerful tool for mesh-based physical scenarios, such as fluids and rigid collisions (Wu et al., 2020). The primary mechanism driving the GNN-based models is message passing (Sanchez-Gonzalez et al., 2020; Pfaff et al., 2021; Allen et al., 2023).