Robustness of Mul-GAD Against Adversarial Attacks in Graph Anomaly Detection

Abstract

Abstract: This report synthesises findings from 12 peer-reviewed papers addressing the following research question: What is the robustness of Mul-GAD against adversarial attacks on graph structure or node features compared to other GNN-based anomaly detection methods, as measured by the drop in F1 score under. Anomaly detection is defined as discovering patterns that do not conform to the expected behavior. Previously, anomaly detection was mostly conducted using traditional shallow learning techniques, but with little improvement. 16 claims were extracted from source literature; 1 was independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 3.8/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research Question

What is the robustness of Mul-GAD against adversarial attacks on graph structure or node features compared to other GNN-based anomaly detection methods, as measured by the drop in F1 score under different attack budgets?

Verification Level

Descriptive public verification status only; aggregate claim counts are public, but individual claim records are not exposed here.

Quality Tier

Descriptive public triage only; this tier does not alter current publication or DOI behavior.

Quality Dimensions

Automated triage signals derived from public fields; not human peer review or independent validation.

Correction Record

Public corrections are additive records. Current status does not claim the synthesis is error-free.

Provenance