A robust approach for estimating change-points in the mean of an AR(1) process

Abstract

We consider the problem of multiple change-point estimation in the mean of a Gaussian AR(1) process. Taking into account the dependence structure does not allow us to use the dynamic programming algorithm, which is the only algorithm giving the optimal solution in the independent case. We propose a robust estimator of the autocorrelation parameter, which is consistent and satisfies a central limit theorem. Then, we propose to follow the classical inference approach, by plugging this estimator in the criteria used for change-points estimation. We show that the asymptotic properties of these estimators are the same as those of the classical estimators in the independent framework. The same plug-in approach is then used to approximate the modified BIC and choose the number of segments. This method is implemented in the R package AR1seg and is available from the Comprehensive R Archive Network (CRAN). This package is used in the simulation section in which we show that for finite sample sizes taking into account the dependence structure improves the statistical performance of the change-point estimators and of the selection criterion.

arXiv comment42 pages, 13 figures

References in corpus (2)

• Optimal detection of changepoints with a linear computational cost
• An MDL approach to the climate segmentation problem

Cited by in corpus (7)

• Selective review of offline change point detection methods
• Detecting Abrupt Changes in the Presence of Local Fluctuations and Autocorrelated Noise
• Multiple change-point detection for Poisson point processes
• ACF estimation via difference schemes for a semiparametric model with m-dependent errors
• Change Point Detection by Cross-Entropy Maximization
• A breakpoint detection in the mean model with heterogeneous variance on fixed time-intervals
• A new segmentation method for the homogenisation of GNSS-derived IWV time-series