Multi-View vs. Single-View Graph Anomaly Detection: Scalability and Efficiency at Scale
Description
This report synthesises findings from 13 peer-reviewed papers addressing the following research question: How do multi-view graph anomaly detection models scale in terms of inference efficiency compared to single-view methods when processing large-scale perturbed graphs, as measured by throughput and. Deep convolutional neural networks have performed remarkably well on many Computer Vision tasks. However, these networks are heavily reliant on big data to avoid overfitting. 10 claims were extracted from source literature; 10 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 do multi-view graph anomaly detection models scale in terms of inference efficiency compared to single-view methods when processing large-scale perturbed graphs, as measured by throughput and latency?
Autonomous literature synthesis. Automated review score: 8.8/10. Full text and citation available at Assignee Research.
Notes
Files
paper.pdf
Files
(76.4 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:dd929a81ea5631fa3ed71e2b668eab59
|
76.4 kB | Preview Download |
Additional details
Related works
- Is compiled by
- https://assignee.net (URL)