Mul-GAD, GAT, and GraphSAGE Training Time Scalability on Large-Scale Graphs

Abstract

Abstract: This report synthesises findings from 3 peer-reviewed papers addressing the following research question: How does the training time scalability of Mul-GAD vary against GAT and GraphSAGE as the number of nodes increases in large-scale graph benchmarks. 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. 5 claims were extracted from source literature; 4 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.0/10. This report is a machine-generated literature synthesis and does not constitute original research.

Research Question

How does the training time scalability of Mul-GAD vary against GAT and GraphSAGE as the number of nodes increases in large-scale graph benchmarks?

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