2017
DOI: 10.1214/17-aos1546
|View full text |Cite
|
Sign up to set email alerts
|

Optimal sequential detection in multi-stream data

Abstract: Consider a large number of detectors each generating a data stream. The task is to detect online, distribution changes in a small fraction of the data streams. Previous approaches to this problem include the use of mixture likelihood ratios and sum of CUSUMs. We provide here extensions and modifications of these approaches that are optimal in detecting normal mean shifts. We show how the (optimal) detection delay depends on the fraction of data streams undergoing distribution changes as the number of detectors… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
46
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 46 publications
(46 citation statements)
references
References 16 publications
(29 reference statements)
0
46
0
Order By: Relevance
“…Second, we study a much larger space of possible changes, including changes in only one parameter at a time. Such change scenarios where only a few of the dimensions change are called sparse changes , and they are the subject of much current interest (Chan, ; Liu et al, ; Wang et al, ; Wang & Samworth, ; Xie & Siegmund, ). Third, we measure sensitivity by the normal Hellinger distance between the marginal distributions of projections before and after a change, whereas Kuncheva and Faithfull () use the normal Bhattacharyya distance.…”
Section: Introductionmentioning
confidence: 99%
“…Second, we study a much larger space of possible changes, including changes in only one parameter at a time. Such change scenarios where only a few of the dimensions change are called sparse changes , and they are the subject of much current interest (Chan, ; Liu et al, ; Wang et al, ; Wang & Samworth, ; Xie & Siegmund, ). Third, we measure sensitivity by the normal Hellinger distance between the marginal distributions of projections before and after a change, whereas Kuncheva and Faithfull () use the normal Bhattacharyya distance.…”
Section: Introductionmentioning
confidence: 99%
“…The asymptotic optimality of a related mixture statistic is established in [3]. Extensions and modifications of the mixture statistic that lead to optimal detection are considered in [1].…”
Section: Introductionmentioning
confidence: 99%
“…In the above references [18,1], the change-point is assumed to cause a shift in the means of the observations by the affected sensors, which is good for modeling an abrupt change. However, in many applications above, the changepoint is an onset of system degradation, which causes a gradual change to the sensor observations.…”
Section: Introductionmentioning
confidence: 99%
“…A mixture statistic which utilizes this sparsity structure of this problem is presented in [5]. The asymptotic optimality of a related mixture statistic is established in [6] and extensions and modifications of the mixture statistic that lead to optimal detection is considered in [7].…”
Section: Introductionmentioning
confidence: 99%
“…In the above references [5]- [7], the change-point is assumed to cause a shift in the mean of the affected sensors, and this is good for modeling an abrupt change. However, in many applications above, the change result in an onset of the system degradation, which may cause a gradual change to the sensor observations, and we set-out to detect the gradual change.…”
Section: Introductionmentioning
confidence: 99%