Cart (Loading....) | Create Account
Close category search window

Anomaly Detection in Time Series of Graphs using Fusion of Graph Invariants

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Youngser Park ; Dept. of Appl. Math. & Stat., Johns Hopkins Univ., Baltimore, MD, USA ; Priebe, C.E. ; Youssef, A.

Given a time series of graphs G(t)=(V,E(t)) , t=1,2,... , where the fixed vertex set V represents “actors” and an edge between vertex u and vertex v at time t(uvE(t)) represents the existence of a communications event between actors u and v during the tth time period, we wish to detect anomalies and/or change points. We consider a collection of graph features, or invariants, and demonstrate that adaptive fusion provides superior inferential efficacy compared to naive equal weighting for a certain class of anomaly detection problems. Simulation results using a latent process model for time series of graphs, as well as illustrative experimental results for a time series of graphs derived from the Enron email data, show that a fusion statistic can provide superior inference compared to individual invariants alone. These results also demonstrate that an adaptive weighting scheme for fusion of invariants performs better than naive equal weighting.

Published in:

Selected Topics in Signal Processing, IEEE Journal of  (Volume:7 ,  Issue: 1 )

Date of Publication:

Feb. 2013

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.