A new proof is given to a known result on the average run length to false alarm of the Shiryayev-Roberts change-point detection policy when the observations are nonlattice. Via the approach of this new proof, the average run length to false alarm can be calculated in the lattice case and for the mixed-type Shiryayev-Roberts scheme.
Publié le : 1995-02-14
Classification:
Quality control,
control charts,
change-point detection,
renewal theory,
62L10,
62N10
@article{1176324467,
author = {Yakir, Benjamin},
title = {A Note on the Run Length to False Alarm of a Change-Point Detection Policy},
journal = {Ann. Statist.},
volume = {23},
number = {6},
year = {1995},
pages = { 272-281},
language = {en},
url = {http://dml.mathdoc.fr/item/1176324467}
}
Yakir, Benjamin. A Note on the Run Length to False Alarm of a Change-Point Detection Policy. Ann. Statist., Tome 23 (1995) no. 6, pp. 272-281. http://gdmltest.u-ga.fr/item/1176324467/