Mul-GAD Performance Scaling with Graph Size and Sparsity in GADBench

Abstract

Abstract: This report synthesises findings from 10 peer-reviewed papers addressing the following research question: How does the performance of Mul-GAD scale with increasing graph size and sparsity compared to other GNN-based semi-supervised anomaly detection models like GANomaly and DeepSVM when evaluated on. With a long history of traditional Graph Anomaly Detection (GAD) algorithms and recently popular Graph Neural Networks (GNNs), it is still not clear (1) how they perform under a standard comprehensive setting, (2) whether GNNs can outperform traditional algorithms such as tree. 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.0/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research Question

How does the performance of Mul-GAD scale with increasing graph size and sparsity compared to other GNN-based semi-supervised anomaly detection models like GANomaly and DeepSVM when evaluated on synthetic and real-world datasets?

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