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
Journal ArticleDOI
Fuzzy C-Means-based Isolation Forest
Paweł Karczmarek,Adam Kiersztyn,Witold Pedrycz,Witold Pedrycz,Witold Pedrycz,Dariusz Czerwinski +5 more
TL;DR: The results of numerical experiments carried using 27 various datasets and reported in this paper lead to the conclusion that FCM can play a pivotal role in an enhancement of Isolation Forest approach and raises up the values of particular measures of effectiveness of the anomaly detection methods.
Proceedings ArticleDOI
Edge classification in networks
TL;DR: This paper presents a series of efficient, neighborhood-based algorithms to perform edge classification in networks, and designs efficient, cost-effective probabilistic edge classification methods without a significant compromise to the classification accuracy.
Posted Content
A Framework for Generalizing Graph-based Representation Learning Methods.
Nesreen K. Ahmed,Ryan A. Rossi,Rong Zhou,John Boaz Lee,Xiangnan Kong,Theodore L. Willke,Hoda Eldardiry +6 more
TL;DR: This work introduces the notion of attributed random walks which serves as a basis for generalizing existing methods such as DeepWalk, node2vec, and many others that leverage random walks and enables these methods to be more widely applicable for both transductive and inductive learning as well as for use on graphs with attributes.
Journal ArticleDOI
A framework to classify heterogeneous Internet traffic with Machine Learning and Deep Learning techniques for satellite communications
TL;DR: This work aims at finding new Internet traffic classification approaches to improving the QoS, and proposes a system that will deal with different Internet communications (encrypted, unencrypted, and tunneled) and process the incoming traffic hierarchically to achieve a high classification performance.
Proceedings ArticleDOI
Towards Interpretation of Node Embeddings
TL;DR: The work presented here constitutes the first step in decoding the black-box of vector embeddings of nodes by evaluating their effectiveness in encoding elementary properties of a node such as page rank, degree, closeness centrality, clustering coefficient, etc.
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.