Self-Supervised vs. Supervised Graph Anomaly Detection Under Feature Masking

This report synthesises findings from 4 peer-reviewed papers addressing the following research question: How do self-supervised graph anomaly detection methods compare to supervised baselines in robustness when 20\% of node features are masked on Amazon and Yelp datasets. Graph anomaly detection (GAD) suffers from heterophily --- abnormal nodes are sparse so that they are connected to vast normal nodes. The current solutions upon Graph Neural Networks (GNNs) blindly smooth the representation of neiboring nodes, thus undermining the discriminative. 6 claims were extracted from source literature; 5 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 7.5/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research goal: How do self-supervised graph anomaly detection methods compare to supervised baselines in robustness when 20% of node features are masked on Amazon and Yelp datasets?

Autonomous literature synthesis. Automated review score: 7.5/10. Full text and citation available at Assignee Research.