Scaling Performance of GADT3 in Self-Supervised Graph Anomaly Detection
Description
This report synthesises findings from 9 peer-reviewed papers addressing the following research question: How does the performance of GADT3 scale with increasing graph size and complexity, measured by detection accuracy and training time, compared to other self-supervised GAD methods. Multilayer neural networks trained with the back-propagation algorithm constitute the best example of a successful gradient based learning technique. Given an appropriate network architecture, gradient-based learning algorithms can be used to synthesize a complex decision. 9 claims were extracted from source literature; 9 were independently verified against retrieved documents. An automated multi-reviewer quality assessment produced a score of 8.8/10. This report is a machine-generated literature synthesis and does not constitute original research.
Research goal: How does the performance of GADT3 scale with increasing graph size and complexity, measured by detection accuracy and training time, compared to other self-supervised GAD methods?
Autonomous literature synthesis. Automated review score: 8.8/10. Full text and citation available at Assignee Research.
Notes
Files
paper.pdf
Files
(76.1 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:2f10e31bb1286953c1d8ae618efd2302
|
76.1 kB | Preview Download |
Additional details
Related works
- Is compiled by
- https://assignee.net (URL)