Sequential algorithms for moving anomaly detection in networks
From MaRDI portal
Publication:5113791
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)
Recommendations
- Detection of intrusions in information systems by sequential change-point methods
- Nearly Optimal Change-Point Detection with an Application to Cybersecurity
- Detection of an anomalous cluster in a network
- Change-point detection in multichannel and distributed systems
- Cusum techniques for timeslot sequences with applications to network surveillance
Cites work
- A Binning Approach to Quickest Change Detection With Unknown Post-Change Distribution
- 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
- Asymptotic operating characteristics of an optimal change point detection in hidden Markov models
- Bayesian quickest detection in sensor arrays
- Change-point detection in multichannel and distributed systems
- Data-Efficient Quickest Change Detection in Minimax Settings
- Efficient scalable schemes for monitoring a large number of data streams
- Information bounds and quick detection of parameter changes in stochastic systems
- Multichannel Sequential Detection—Part I: Non-i.i.d. Data
- On the Best 2-CUSUM Stopping Rule for Quickest Detection of Two-Sided Alternatives in a Brownian Motion Model
- One Shot Schemes for Decentralized Quickest Change Detection
- Optimal Sequential Surveillance for Finance, Public Health, and Other Areas
- Optimal detection of a change in distribution
- Procedures for Reacting to a Change in Distribution
- Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis
- Quickest Change Detection and Kullback-Leibler Divergence for Two-State Hidden Markov Models
- Quickest Change Detection of a Markov Process Across a Sensor Array
- SPRT and CUSUM in hidden Markov models
- Second-Order Asymptotic Optimality in Multisensor Sequential Change Detection
- Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple
- Sequential multi-sensor change-point detection
- Statistical Power System Line Outage Detection Under Transient Dynamics
Cited in
(8)- Isolating changed panels and estimating common change point after sequential detection with FDR control
- Comparing finite sequences of discrete events with non-uniform time intervals
- Inductive conformal anomaly detection for sequential detection of anomalous sub-trajectories
- Expansion of Matching Pursuit Methodology for Anomaly Detection in Computer Networks
- Statistical detection of enterprise network problems
- Sequential network change detection with its applications to ad impact relation analysis
- Bayesian localization of anomaly in distributed networks with quadratic criterion
- Sequential anomaly detection in wireless sensor networks and effects of long-range dependent data
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)
