Anomaly Detection in Dynamic Graphs: A Comprehensive Survey
Ocheme Anthony Ekle, William Eberle

TL;DR
This comprehensive survey reviews various techniques for anomaly detection in dynamic graphs, categorizing approaches, discussing their advantages, and highlighting future research challenges in the field.
Contribution
It introduces a new review framework for dynamic graph anomaly detection approaches and compares existing surveys, providing insights into strengths, limitations, and future directions.
Findings
Deep learning approaches show promising results.
Graph-based methods effectively capture relational structures.
Identified key challenges and open research questions.
Abstract
This survey paper presents a comprehensive and conceptual overview of anomaly detection using dynamic graphs. We focus on existing graph-based anomaly detection (AD) techniques and their applications to dynamic networks. The contributions of this survey paper include the following: i) a comparative study of existing surveys on anomaly detection; ii) a Dynamic Graph-based Anomaly Detection (DGAD) review framework in which approaches for detecting anomalies in dynamic graphs are grouped based on traditional machine-learning models, matrix transformations, probabilistic approaches, and deep-learning approaches; iii) a discussion of graphically representing both discrete and dynamic networks; and iv) a discussion of the advantages of graph-based techniques for capturing the relational structure and complex interactions in dynamic graph data. Finally, this work identifies the potential…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsFocus
