Graph Anomaly Detection Algorithm Based on Multi-View Heterogeneity Resistant Network
Yangrui Fan, Caixia Cui, Zhiqiang Wang, Hui Qi, Zhen Tian · Information · 2025
Graph anomaly detection (GAD) aims to identify nodes or edges that deviate from normal patterns. However, the presence of heterophilic edges in graphs leads to feature over-smoothing issues. To overcome this limitation, this paper proposes the multi-view heterogeneity resistant network (MV-GHRN) model, which progressively purifies heterophilic edges through multi-view collaboration. First, to address the noise sensitivity of single predictions, the method computes post-aggregation (PA) scores for both the original graph and its perturbed versions and performs weighted fusion, leveraging the consistency of multiple prediction perspectives to enhance the reliability of heterophilic edge identification. Second, a cosine similarity view is introduced as a complementary structural perspective, with both views independently completing heterophilic edge pruning to clean the graph structure from both topological and feature dimensions. Finally, a cross-view self-distillation mechanism is designed, using the fused predictions from the two purified views as teacher signals to guide the optimization of each view in reverse, correcting feature biases caused by heterophilic edges. Experiments on benchmark datasets such as YelpChi and Amazon demonstrate that the framework significantly outperforms existing methods. For instance, on the YelpChi dataset, MV-GHRN surpasses the best baseline by 16.8% and 5.2% in F1-Macro and AUC, respectively, validating the effectiveness of the progressive multi-view purification mechanism.