Sequential algorithms for moving anomaly detection in networks
DOI10.1080/07474946.2020.1726678zbMATH Open1442.62184OpenAlexW3024133375MaRDI QIDQ5113791FDOQ5113791
Georgios Rovatsos, Venugopal V. Veeravalli, Shaofeng Zou
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
Markov processes: estimation; hidden Markov models (62M05) Applications of graph theory (05C90) Asymptotic properties of parametric tests (62F05) Sequential statistical analysis (62L10) Markov processes: hypothesis testing (62M02) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40)
Cites Work
- Efficient scalable schemes for monitoring a large number of data streams
- Information bounds and quick detection of parameter changes in stochastic systems
- Procedures for Reacting to a Change in Distribution
- Optimal detection of a change in distribution
- A novel approach to detection of intrusions in computer networks via adaptive sequential and batch-sequential change-point detection methods
- Sequential multi-sensor change-point detection
- SPRT and CUSUM in hidden Markov models
- On the Best 2-CUSUM Stopping Rule for Quickest Detection of Two-Sided Alternatives in a Brownian Motion Model
- Title not available (Why is that?)
- Asymptotic operating characteristics of an optimal change point detection in hidden Markov models
- Optimal Sequential Surveillance for Finance, Public Health, and Other Areas
- Quickest Change Detection of a Markov Process Across a Sensor Array
- One Shot Schemes for Decentralized Quickest Change Detection
- Second-Order Asymptotic Optimality in Multisensor Sequential Change Detection
- Multichannel Sequential Detection—Part I: Non-i.i.d. Data
- Statistical Power System Line Outage Detection Under Transient Dynamics
- Quickest Change Detection and Kullback-Leibler Divergence for Two-State Hidden Markov Models
- Asymptotic Bayesian Theory of Quickest Change Detection for Hidden Markov Models
- Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis
- Data-Efficient Quickest Change Detection in Minimax Settings
- Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple
- A Binning Approach to Quickest Change Detection With Unknown Post-Change Distribution
- Bayesian Quickest Detection in Sensor Arrays
Cited In (5)
- Statistical detection of enterprise network problems
- Expansion of Matching Pursuit Methodology for Anomaly Detection in Computer Networks
- Comparing finite sequences of discrete events with non-uniform time intervals
- Isolating changed panels and estimating common change point after sequential detection with FDR control
- Sequential network change detection with its applications to ad impact relation analysis
This page was built for publication: Sequential algorithms for moving anomaly detection in networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113791)
