Graph based anomaly detection and description: a survey
TLDR
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, and gives a general framework for the algorithms categorized under various settings.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 challenges in the field.read more
Citations
More filters
Posted Content
CFOF: A Concentration Free Measure for Anomaly Detection
TL;DR: It is theoretically proved that CFOF does not concentrate in the Euclidean space for any arbitrary large dimensionality, and it is formally proved that classical distance-based and density-based outliers concentrate both for bounded and unbounded sample sizes and for fixed and variable values of the neighborhood parameter.
Journal ArticleDOI
Structural Predictability Optimization Against Inference Attacks in Data Publishing
TL;DR: An active learning algorithm is presented that can learn the role of links accurately in term of graph organization, and the performance of structure inference on graphs can be deteriorated effectively by representative link-based perturbation.
Journal ArticleDOI
Learning to count: A deep learning framework for graphlet count estimation
TL;DR: A deep learning framework which contains two convolutional neural network models and a series of data preprocessing techniques to solve the GCL problem, which can offer up to two orders of magnitude speedup on synthetic graphs and achieves on par speed on real world graphs with competitive accuracy.
Journal ArticleDOI
Diverse Power Iteration Embeddings: Theory and Practice
TL;DR: This work proposes a novel efficient embedding construction, Diverse Power Iteration Embedding (DPIE), and shows the effectiveness and efficiency of DPIE on clustering, anomaly detection, and feature selection as case studies.
Journal ArticleDOI
UN-AVOIDS: Unsupervised and Nonparametric Approach for Visualizing Outliers and Invariant Detection Scoring
TL;DR: UN-AVOIDS as mentioned in this paper is an unsupervised and nonparametric approach for both visualization (a human process) and detection (an algorithmic process) of outliers, that assigns invariant anomalous scores (normalized to [0, 1]), rather than hard binary-decision.
References
More filters
Journal ArticleDOI
Collective dynamics of small-world networks
TL;DR: Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.
Journal ArticleDOI
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
Book
Time series analysis, forecasting and control
TL;DR: In this article, a complete revision of a classic, seminal, and authoritative book that has been the model for most books on the topic written since 1970 is presented, focusing on practical techniques throughout, rather than a rigorous mathematical treatment of the subject.