Robustness of Semi-Supervised Graph Anomaly Detection Across Varying Graph Sizes

This report synthesises findings from 7 peer-reviewed papers addressing the following research question: How does the robustness of semi-supervised graph anomaly detection models with decoupled aggregation and transformation compare across different graph sizes in the WebKB dataset when evaluated using. Deep learning approaches to anomaly detection (AD) have recently improved the state of the art in detection performance on complex data sets, such as large collections of images or text. These results have sparked a renewed interest in the AD problem and led to the introduction. 7 claims were extracted from source literature; 7 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.3/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research goal: How does the robustness of semi-supervised graph anomaly detection models with decoupled aggregation and transformation compare across different graph sizes in the WebKB dataset when evaluated using AUC-ROC scores?

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