Sequential change-point detection when unknown parameters are present in the pre-change distribution

65Citations
Citations of this article
47Readers
Mendeley users who have this article in their library.

Abstract

In the sequential change-point detection literature, most research specifies a required frequency of false alarms at a given pre-change distribution f θ and tries to minimize the detection delay for every possible post-change distribution g λ. In this paper, motivated by a number of practical examples, we first consider the reverse question by specifying a required detection delay at a given post-change distribution and trying to minimize the frequency of false alarms for every possible pre-change distribution f θ. We present asymptotically optimal procedures for one-parameter exponential families. Next, we develop a general theory for change-point problems when both the prechange distribution f θ and the post-change distribution g λ involve unknown parameters. We also apply our approach to the special case of detecting shifts in the mean of independent normal observations. © Institute of Mathematical Statistics, 2006.

Cite

CITATION STYLE

APA

Mei, Y. (2006). Sequential change-point detection when unknown parameters are present in the pre-change distribution. Annals of Statistics, 34(1), 92–122. https://doi.org/10.1214/009053605000000859

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free