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

From MaRDI portal
Publication:2493547

DOI10.1214/009053605000000859zbMATH Open1091.62064arXivmath/0605322OpenAlexW3101806252MaRDI QIDQ2493547FDOQ2493547


Authors: Yajun Mei Edit this on Wikidata


Publication date: 21 June 2006

Published in: The Annals of Statistics (Search for Journal in Brave)

Abstract: In the sequential change-point detection literature, most research specifies a required frequency of false alarms at a given pre-change distribution fheta and tries to minimize the detection delay for every possible post-change distribution glambda. 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 fheta. We present asymptotically optimal procedures for one-parameter exponential families. Next, we develop a general theory for change-point problems when both the pre-change distribution fheta and the post-change distribution glambda involve unknown parameters. We also apply our approach to the special case of detecting shifts in the mean of independent normal observations.


Full work available at URL: https://arxiv.org/abs/math/0605322




Recommendations




Cites Work


Cited In (32)





This page was built for publication: Sequential change-point detection when unknown parameters are present in the pre-change distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2493547)