Affiliations: [a] Department of Computer Science, Tennessee Technological University, Cookeville, TN, USA | [b] School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, USA
Correspondence:
[*]
Corresponding author: William Eberle, Department of Computer Science, Tennessee Technological University, Box 5101, Cookeville, TN 38505, USA. Tel.: +1 931 372 3278; Fax: +1 931 372 3686; E-mail: weberle@tntech.edu.
Abstract: The advantage of graph-based anomaly detection is that the relationships between elements can be analyzed for structural oddities that could represent activities such as fraud, network intrusions, or suspicious associations in a social network. Traditionally, methods for discovering anomalies have ignored information about the relationships between people, e.g., who they know, or who they call. One approach to handling such data is to use a graph representation and detect normative patterns and anomalies in the graph. However, current approaches to detecting anomalies in graphs are computationally expensive and do not scale to large graphs. In this work, we describe methods for scalable graph-based anomaly detection via graph partitioning and windowing, and demonstrate its ability to efficiently detect anomalies in data represented as a graph.
