Abstract
The sequential changepoint detection problem is studied in the context of global online monitoring of a large number of independent data streams. We are interested in detecting an occurring event as soon as possible, but we do not know when the event will occur, nor do we know which subset of data streams will be affected by the event. A family of scalable schemes is proposed based on the sum of the local cumulative sum, cusum, statistics from each individual data stream, and is shown to asymptotically minimize the detection delays for each and every possible combination of affected data streams, subject to the global false alarm constraint. The usefulness and limitations of our asymptotic optimality results are illustrated by numerical simulations and heuristic arguments. The Appendices contain a probabilistic result on the first epoch to simultaneous record values for multiple independent random walks.
Original language | English (US) |
---|---|
Pages (from-to) | 419-433 |
Number of pages | 15 |
Journal | Biometrika |
Volume | 97 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2010 |
Keywords
- Change detection
- CUSUM
- Renewal theory
- Scalability
- Sequential detection
- Simultaneous record
ASJC Scopus subject areas
- Statistics and Probability
- General Mathematics
- Agricultural and Biological Sciences (miscellaneous)
- General Agricultural and Biological Sciences
- Statistics, Probability and Uncertainty
- Applied Mathematics