Asymptotically Optimal Anomaly Detection via Sequential Testing
arXiv:1405.4659 · doi:10.1109/TSP.2015.2416674
Abstract
Sequential detection of independent anomalous processes among K processes is considered. At each time, only M processes can be observed, and the observations from each chosen process follow two different distributions, depending on whether the process is normal or abnormal. Each anomalous process incurs a cost per unit time until its anomaly is identified and fixed. Switching across processes and state declarations are allowed at all times, while decisions are based on all past observations and actions. The objective is a sequential search strategy that minimizes the total expected cost incurred by all the processes during the detection process under reliability constraints. Low-complexity algorithms are established to achieve asymptotically optimal performance as the error constraints approach zero. Simulation results demonstrate strong performance in the finite regime.
28 pages, 5 figures, part of this work will be presented at the 52nd Annual Allerton Conference on Communication, Control, and Computing, 2014
References in corpus (2)
Cited by in corpus (11)
- Searching for Anomalies over Composite Hypotheses
- Spectrum and Energy Efficient Multiple Access for Detection in Wireless Sensor Networks
- Anomaly Search with Multiple Plays under Delay and Switching Costs
- Utility Maximizing Sequential Sensing Over a Finite Horizon
- Active Sampling of Multiple Sources for Sequential Estimation
- Active Sampling for the Quickest Detection of Markov Networks
- Asymptotically Optimal Stochastic Encryption for Quantized Sequential Detection in the Presence of Eavesdroppers
- Anomaly Detection in Hierarchical Data Streams under Unknown Models
- Active Anomaly Detection in Heterogeneous Processes
- Active Anomaly Detection with Switching Cost
- Sequential anomaly detection with sampling constraints