Sequential Change-Point Detection Procedures That are Nearly Optimal and Computationally Simple

DOI10.1080/07474940802446244zbMath1149.62069OpenAlexW1985936867MaRDI QIDQ3543508

Moshe Pollak, Gary Lorden

Publication date: 4 December 2008

Published in: Sequential Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07474940802446244

zbMATH Keywords

asymptotic optimalitychange-point detectionaverage run length

Mathematics Subject Classification ID

Sequential statistical analysis (62L10) Optimal stopping in statistics (62L15)

Related Items

A combined SR-CUSUM procedure for detecting common changes in panel data, Rapid online plant leaf area change detection with high-throughput plant image data, Asymptotic optimality theory for active quickest detection with unknown postchange parameters, Sequential algorithms for moving anomaly detection in networks, Detecting changes in a multiparameter exponential family by using adaptive CUSUM procedure, Asymptotic statistical properties of communication-efficient quickest detection schemes in sensor networks, Discussion on “Change-Points: From Sequential Detection to Biology and Back” by David O. Siegmund, Sequential Change-Point Detection When the Pre- and Post-Change Parameters are Unknown, Fast and accurate detection of changes in data streams, An Adaptive Shiryaev–Roberts Procedure for Signalling Varying Location Shifts, Discussion on “Optimal Sequential Surveillance for Finance, Public Health, and Other Areas” by Marianne Frisén

Cites Work

• Unnamed Item
• Decision theoretic optimality of the cusum procedure
• Sequential detection of a change in a normal mean when the initial value is unknown
• Optimal detection of a change in distribution
• Optimal stopping times for detecting changes in distributions
• Average run lengths of an optimal method of detecting a change in distribution
• The expected sample size of some tests of power one
• Optimality and almost optimality of mixture stopping rules
• An efficient sequential nonparametric scheme for detecting a change of distribution
• Average run length to false alarm for surveillance schemes designed with partially specified pre-change distribution
• Detecting a change in regression: First-order optimality
• On the average run length to false alarm in surveillance problems which possess an invariance structure
• Using the generalized likelihood ratio statistic for sequential detection of a change-point
• A robust surveillance scheme for stochastically ordered alternatives
• Nonanticipating estimation applied to sequential analysis and changepoint detection
• Surveillance of a Simple Linear Regression