On the average run length to false alarm in surveillance problems which possess an invariance structure
Yakir, Benjamin
Ann. Statist., Tome 26 (1998) no. 3, p. 1198-1214 / Harvested from Project Euclid
Surveillance can be based, in some change-point detection problems, on a sequence of invariant statistics. Gordon and Pollak prove that, under certain conditions, the average run length (ARL) to false alarm of invariance- based Shiryayev–Roberts detection schemes is asymptotically the same as that of the dual classical scheme that is based on the original sequence of observations. In this paper we give alternative conditions under which the two ARLs coincide and demonstrate that these conditions are satisfied in cases where Gordon and Pollak’s conditions are difficult to check.
Publié le : 1998-06-14
Classification:  Quality control,  control charts,  change-point detection,  invariant statistics,  62L10,  62N10
@article{1024691095,
     author = {Yakir, Benjamin},
     title = {On the average run length to false alarm in surveillance problems
		 which possess an invariance structure},
     journal = {Ann. Statist.},
     volume = {26},
     number = {3},
     year = {1998},
     pages = { 1198-1214},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1024691095}
}
Yakir, Benjamin. On the average run length to false alarm in surveillance problems
		 which possess an invariance structure. Ann. Statist., Tome 26 (1998) no. 3, pp.  1198-1214. http://gdmltest.u-ga.fr/item/1024691095/