Deep Learning for Anomaly Detection in Dynamic Graphs: A Verified Taxonomy, Survey, and Unified Benchmark
Iyad Assaad Nekka, Hamida Seba, Walid-Khaled Hidouci, Karima Amrouche
École Nationale Supérieure d'Informatique Lyon 1 Université
阅读操作
确认中在文库中上传 PDF 后可生成中文音频讲解。
摘要与影响
Anomaly detection in dynamic graphs (DGAD) sits at the intersection of graph learning and temporal modeling, yet it presents itself as a scattered collection of isolated methods: results are dispersed across dozens of venues, published numbers are mutually incomparable, and no reference delimits the field, so surveys routinely conflate dynamic-graph detectors with staticgraph and multivariate time-series methods. This paper supplies the missing reference in both of its layers, organization and measurement. We delimit the field with three explicit, checkable inclusion criteria; we present a catalog of twenty-four methods, each traced to its primary publication and its publication status stated, organized by a two-axis taxonomy of structural encoder × temporal mechanism; and we list, with reasons, the prominent methods that fail each criterion. We then benchmark representatives of all seven taxonomy families, thirteen deep detectors, a non-deep streaming baseline, and a suite of parameter-free heuristics, under one injection protocol, split, and metric set. The results concern the field’s evaluation practice as much as its methods. A degree heuristic that requires no training reaches AUC 0.811 on the canonical injected benchmark, above nine of thirteen deep detectors, and holds across a second corpus, a second injection model, and all 162 configurations of the protocol’s parameter space; on real fraud labels it falls below chance. There the ranking rearranges by time model rather than by injected rank: both snapshot-based leaders drop to chance while the continuous-time streaming detector leads. We further find that headline AUC misranks methods on injected data, and that published implementations frequently contain resultchanging evaluation defects. We distill these findings into concrete recommendations and release the full benchmark.
逐年被引趋势
关键指标
同类平均 = 1
同领域 · 同年份 · 同类型
Google Scholar 与 OpenAlex 的被引统计范围不同,数值存在差异属正常。
AI 辅助阅读
依据:摘要
可就本文提问;依据不足时会说明。
学术脉络
学科主题
计算机 / AIAnomaly Detection Techniques and Applications
Advanced Graph Neural Networks · Complex Network Analysis Techniques