Metraipolis › archive › dc_d5ad7d147a4e
Beat the Counter First: A Baseline for Temporal-Graph Anomaly Detectors — arXiv:2608.15965
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.15965
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T19:41:08.353Z
- SHA-256 of the archived text
64b68ae45c069580dfd6c4cf693cbc92351522ba11dce491ad2759baae972597- Stable URL of this page
https://metraipolis.com/documento/dc_d5ad7d147a4e
How to cite
Beat the Counter First: A Baseline for Temporal-Graph Anomaly Detectors — arXiv:2608.15965 — arXiv (en), https://arxiv.org/abs/2608.15965 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d5ad7d147a4e (Metraipolis archive dc_d5ad7d147a4e, sha256 64b68ae45c069580dfd6c4cf693cbc92351522ba11dce491ad2759baae972597)
BibTeX
@misc{dcd5ad7d147a4e,
title = {Beat the Counter First: A Baseline for Temporal-Graph Anomaly Detectors — arXiv:2608.15965},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.15965},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d5ad7d147a4e; sha256 64b68ae45c069580dfd6c4cf693cbc92351522ba11dce491ad2759baae972597},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15965. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Progress in streaming, edge-level graph anomaly detection (GAD) has been marked by increasingly elaborate architectures, from count-min-sketch chi square tests to memory-augmented attention networks. Yet the empirical gains attributable to this added complexity have not been systematically evaluated. We propose SimpleCount, a reference with no parameter fitting that selects one scalar feature per dataset from a fixed pool of counts, recencies, first-occurrence indicators, and count-derived transforms. We compare SimpleCount with two temporal-graph detector models and an IsoForest control fitted to the complete feature vector across five public datasets and one synthetic dataset. SimpleCount matches or exceeds SLADE on three of six datasets and exceeds IsoForest on all six. We report paired statistical tests and five-seed SLADE evaluations. SLADE requires 23 to 133x more wall-clock time than SimpleCount. On Synth-Triangle and an additional Synth-Quad probe, pre-event structural scores recover the planted signal at AUC up to 0.955, while all evaluated detector models remain near random. The benefit of complexity is dataset-dependent, and every claimed gain should be reported against a strong one-feature reference together with its compute cost. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-18 in cs.LG). Categorie arXiv: Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2608.15965 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T19:02:44.136Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).