2014/01/15 by George V. Moustakides, Moustakides, George V.
Mathematics · #Applications (stat.AP) #FOS: Computer and information sciences #FOS: Mathematics #Statistics Theory (math.ST) #math.ST #stat.AP #stat.TH
paper · pdf · doi:10.48550/arxiv.1401.3408
31 pages
arxiv created 2014/01/15 · arxiv updated 2014/01/16
For the problem of sequential detection of changes, we adopt the probability maximizing approach in place of the classical minimization of the average detection delay, and propose modified versions of the Shiryaev, Lorden and Pollak performance measures. For these alternative formulations, we demonstrate that the optimum sequential detection scheme is the simple Shewhart rule. Interestingly, we can also solve problems which under the classical setup have been open for many years, as optimum change detection with time varying observations or with multiple post-change probability measures. For the last case, we also offer the exact solution for Lorden's original setup when the average false alarm period is within certain limits.