The DOI matches its Crossref record; 283 of the 284 references it cites were found in a registry or an index.
Graph based anomaly detection and description: a survey
Abstract
Detecting anomalies in data is a vital task, with numerous high-impact applications in areas such as security, finance, health care, and law enforcement. While numerous techniques have been developed in past years for spotting outliers and anomalies in unstructured collections of multi-dimensional points, with graph data becoming ubiquitous, techniques for structured graph data have been of focus recently. As objects in graphs have long-range correlations, a suite of novel technology has been developed for anomaly detection in graph data. This survey aims to provide a general, comprehensive, and structured overview of the state-of-the-art methods for anomaly detection in data represented as graphs. As a key contribution, we give a general framework for the algorithms categorized under various settings: unsupervised versus (semi-)supervised approaches, for static versus dynamic graphs, for attributed versus plain graphs. We highlight the effectiveness, scalability, generality, and robustness aspects of the methods. What is more, we stress the importance of anomaly attribution and highlight the major techniques that facilitate digging out the root cause, or the ‘why’, of the detected anomalies for further analysis and sense-making. Finally, we present several real-world applications of graph-based anomaly detection in diverse domains, including financial, auction, computer traffic, and social networks. We conclude our survey with a discussion on open theoretical and practical c…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Research works presented by Chandola et al. [22] and Akoglu et al. [23] glanced at the anomaly detection process more globally and did not focus on microservices architecture.”
From Anomaly detection and root-cause identification in microservices: a survey (2026) · cites this paper as [23]
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060 · cited 2×
“…measures such as eigenvector [Bonacich and Lloyd, 2001], closeness [Noh and Rieger, 2004], and betweenness [Freeman, 1977] centralities, local clustering coefficient [Watts and Strogatz, 1998], radius [Kang et al., 2011c], degree assortativity, and most recently, roles [Henderson et al., 2012].”
BackgroundEmergence of Scaling in Random Networks
Barabási, A.-L., & Albert, R. (1999) · Science · doi:10.1126/science.286.5439.509 · Cited by 36,135
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Time Series Analysis: Forecasting and Control
Geurts, M., Box, G. E. P., & Jenkins, G. M. (1977) · Journal of Marketing Research · doi:10.2307/3150485 · Cited by 19,186
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
(2011) · Cited by 14,317
Finding and evaluating community structure in networks
Newman, M. E. J., & Girvan, M. (2004) · Physical Review E · doi:10.1103/physreve.69.026113 · Cited by 13,931 · cited 2×
“…2001, Shi and Malik, 1997]; evolutionary clustering [Chakrabarti et al., 2006]; the Newman’s algorithms for community detection in complex systems [Newman and Girvan, 2004],[Newman, 2004],[Newman, 2006]; co-clustering for concurrent clustering of the rows and the columns of the adjacency matrix…”
MethodIndexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Research works printed but not linked: 8
- Akoglu L, Faloutsos C (2010) Event detection in time series of mobile communication graphs. In: Proceedings of army science conference
- Becchetti L, Castillo C, Donato D, Leonardi S, Baeza-Yates R (2006) Link-based characterization and detection of Web Spam. In: Second international workshop on adversarial information retrieval on the web (AIRWeb)
- Brin S, Page L (1998) The anatomy of a large-scale hypertextual web search engine. Comput Netw 30(1–7):107–117
- Li G, Semerci M, Yener B, Zaki MJ (2011a) Graph classification via topological and label attributes. In: Proceedings of the 9th international workshop on mining and learning with graphs (MLG), San Diego, USA
- Neill DB, Wong W.-K (2009) A tutorial on event detection tutorial. In: ACM international conference on knowledge discovery and data mining (SIGKDD)
- Peabody M (2003) Finding groups of graphs in databases. Master’s thesis, Drexel University
- Phua C, Lee VCS, Smith-Miles K, Gayler RW (2010) A comprehensive survey of data mining-based fraud detection research. CoRR, abs/1009.6119 · arXiv
- Pincombe B (2005) Anomaly detection in time series of graphs using arma processes. ASOR Bull 24(4): 2–10
Cited by
Deep Learning for Anomaly Detection: A Review
Pang, G., Shen, C., Cao, L., & Hengel, A. V. D. (2022) · ACM Computing Surveys · doi:10.1145/3439950 · Cited by 2,837
“urrent deep anomaly detection methods and their capabilities in addressing these challenges, and finally presents a number of future opportunities in this area. As a popular area, a number of studies [2, 4, 16, 28, 54, 63, 178] have been dedicated to the categorization and review of anomaly detection techniques. Howev…”
BackgroundGraph convolutional networks: a comprehensive review
Zhang, S., Tong, H., Xu, J., & Maciejewski, R. (2019) · Computational Social Networks · doi:10.1186/s40649-019-0069-y · Cited by 1,888
“Graphs naturally arise in many real-world applications, including social analysis [1], fraud detection [2, 3], traffic prediction [4], computer vision [5], and many more.”
BackgroundSelf-citationf-AnoGAN: Fast unsupervised anomaly detection with generative adversarial networks
Schlegl, T., Seeböck, P., Waldstein, S. M., Langs, G., & Schmidt-Erfurth, U. (2019) · Medical Image Analysis · doi:10.1016/j.media.2019.01.010 · Cited by 1,545
Cui, P., Wang, X., Pei, J., & Zhu, W. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2849727 · Cited by 1,274
A Unifying Review of Deep and Shallow Anomaly Detection
Ruff, L., Kauffmann, J. R., Vandermeulen, R. A., Montavon, G., Samek, W., Kloft, M., Dietterich, T. G., & Muller, K.-R. (2021) · Proceedings of the IEEE · doi:10.1109/jproc.2021.3052449 · Cited by 914
“These include point anomalies, conditional or contextual anomalies [169], [171], [191]–[195], and group or collective anomalies [146], [193], [196]–[199].”
Background
Metadata
- Authors
- Akoglu, L., Tong, H., & Koutra, D.
- Affiliations
- Stony Brook University (US)
- City College of New York (US)
- Carnegie Mellon University (US)
- Corresponding author
- Akoglu, Leman
- Venue
- Data Mining and Knowledge Discovery
- Published
- 2014-07-05
- Volume
- 29
- Issue
- 3
- Pages
- 626-688
- ISSN
- 1384-5810 (ISSN-L)
- 1573-756X
- OpenAlex
- W2089554624
- Cited by
- 1,504
- References
- 284
- Citations by year
- 2026: 123 · 2025: 164 · 2024: 137 · 2023: 152 · 2022: 155 · 2021: 162 · 2020: 156 · 2019: 123 · 2018: 131 · 2017: 108 · 2016: 69 · 2015: 23 · 2014: 1
- FWCI
- 66.80
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Data Mining and Knowledge Discovery (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Anomaly Detection Techniques and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Keywords
- graph anomaly detection, attributed graphs, dynamic graphs, semi-supervised learning, unsupervised learning, graph data, root cause analysis, financial fraud detection, social network analysis
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Graph based anomaly detection and description: a survey. https://app.cochat.ai/papers/10.1007/s10618-014-0365-y
- The paper
- Akoglu, L., Tong, H., & Koutra, D. (2015). Graph based anomaly detection and description: a survey. Data Mining and Knowledge Discovery. https://doi.org/10.1007/s10618-014-0365-y
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.