Bayesian anomaly detection methods for social networks

Abstract

Learning the network structure of a large graph is computationally demanding, and dynamically monitoring the network over time for any changes in structure threatens to be more challenging still. This paper presents a two-stage method for anomaly detection in dynamic graphs: the first stage uses simple, conjugate Bayesian models for discrete time counting processes to track the pairwise links of all nodes in the graph to assess normality of behavior; the second stage applies standard network inference tools on a greatly reduced subset of potentially anomalous nodes. The utility of the method is demonstrated on simulated and real data sets.

Published in at http://dx.doi.org/10.1214/10-AOAS329 the Annals of Applied Statistics (http://www.imstat.org/aoas/) by the Institute of Mathematical Statistics (http://www.imstat.org)

References in corpus (1)

• Bayesian anomaly detection methods for social networks

Cited by in corpus (7)

• Bayesian anomaly detection methods for social networks
• Locality statistics for anomaly detection in time series of graphs
• GAD-NR: Graph Anomaly Detection via Neighborhood Reconstruction
• Self-exciting hurdle models for terrorist activity
• NHAD: Neuro-Fuzzy Based Horizontal Anomaly Detection In Online Social Networks
• Conditional anomaly detection with soft harmonic functions
• Online Bayesian changepoint detection for network Poisson processes with community structure