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
Proceedings ArticleDOI
Pikachu: Temporal Walk Based Dynamic Graph Embedding for Network Anomaly Detection
TL;DR: PIKACHU as discussed by the authors is a sophisticated, unsupervised, temporal walk-based dynamic network embedding technique that can capture both network topology as well as highly granular temporal information.
Journal ArticleDOI
A step towards the majority-based clustering validation decision fusion method
Taras Panskyi,Volodymyr Mosorov +1 more
TL;DR: The author proposed to enhance the standard majority-based decision fusion method with straightforward rules for the maximum efficiency of the validation procedure and showed that the designed enhanced method with an invasive validation configuration could cope with almost all data sets with different experimental factors.
Book ChapterDOI
Determination of Optimal Cluster Number in Connection to SCADA
Jan Vavra,Martin Hromada +1 more
TL;DR: The aim of the article is to determine the number of clusters in relation to Supervisory Control and Data Acquisition system with respect to K-means algorithm.
Book ChapterDOI
Handling Pregel’s Limits in Big Graph Processing in the Presence of High-Degree Vertices
TL;DR: This article introduces a scalable MapReduce graph partitioning approach for high-degree vertices using master/slave partitioning that makes Pregel-like systems, in graph processing, scalable and insensitive to the effects of high- degree vertices while guaranteeing perfect balancing properties of communication and computation during all the stages of big graph processing.
Book ChapterDOI
Big Data Analytics and Models
TL;DR: This chapter is intended to explore big data analytics as a comprehensive technique for processing large amounts of data to uncover insights for financial instability engendered to the victims of different sorts of perils.
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.