Efficient scalable schemes for monitoring a large number of data streams
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, <sc>cusum</sc>, 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. Copyright 2010, Oxford University Press.
Year of publication: |
2010
|
---|---|
Authors: | Mei, Y. |
Published in: |
Biometrika. - Biometrika Trust, ISSN 0006-3444. - Vol. 97.2010, 2, p. 419-433
|
Publisher: |
Biometrika Trust |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Key issues in China's sustainable urbanization
Chen, Gui-sheng, (2011)
-
Qualitative and quantitative evaluation of the security degree for Chinese iron and steel industry
Jing, Zhucui, (2013)
-
A two-stage heuristic approach for fleet management optimization under time-varying demand
Zhang, Le, (2021)
- More ...