Sequential algorithms for moving anomaly detection in networks
DOI10.1080/07474946.2020.1726678zbMath1442.62184OpenAlexW3024133375MaRDI QIDQ5113791
Georgios Rovatsos, Shaofeng Zou, Venugopal V. Veeravalli
Publication date: 17 June 2020
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07474946.2020.1726678
hidden Markov modelsensor networksgeneralized likelihood ratioquickest change detectiondynamic anomaly
Applications of graph theory (05C90) Markov processes: estimation; hidden Markov models (62M05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40) Sequential statistical analysis (62L10) Asymptotic properties of parametric tests (62F05) Markov processes: hypothesis testing (62M02)
Related Items
Cites Work
- Unnamed Item
- Efficient scalable schemes for monitoring a large number of data streams
- Sequential multi-sensor change-point detection
- Optimal detection of a change in distribution
- SPRT and CUSUM in hidden Markov models
- Asymptotic operating characteristics of an optimal change point detection in hidden Markov models
- Second-Order Asymptotic Optimality in Multisensor Sequential Change Detection
- Optimal Sequential Surveillance for Finance, Public Health, and Other Areas
- Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple
- On the Best 2-CUSUM Stopping Rule for Quickest Detection of Two-Sided Alternatives in a Brownian Motion Model
- Quickest Change Detection and Kullback-Leibler Divergence for Two-State Hidden Markov Models
- A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods
- Asymptotic Bayesian Theory of Quickest Change Detection for Hidden Markov Models
- Statistical Power System Line Outage Detection Under Transient Dynamics
- A Binning Approach to Quickest Change Detection With Unknown Post-Change Distribution
- Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis
- Bayesian Quickest Detection in Sensor Arrays
- Information bounds and quick detection of parameter changes in stochastic systems
- One Shot Schemes for Decentralized Quickest Change Detection
- Quickest Change Detection of a Markov Process Across a Sensor Array
- Data-Efficient Quickest Change Detection in Minimax Settings
- Multichannel Sequential Detection—Part I: Non-i.i.d. Data
- Procedures for Reacting to a Change in Distribution