On optimal multiple changepoint algorithms for large data - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Statistics and Computing Année : 2017

On optimal multiple changepoint algorithms for large data

Résumé

Many common approaches to detecting change-points, for example based on statistical criteria such as penalised likelihood or minimum description length, can be formulated in terms of minimising a cost over segmentations. We focus on a class of dynamic programming algorithms that can solve the resulting minimisation problem exactly, and thus find the optimal segmentation under the given statistical criteria. The standard implementation of these dynamic programming methods have a computational cost that scales at least quadratically in the length of the time-series. Recently pruning ideas have been suggested that can speed up the dynamic programming algorithms, whilst still being guaranteed to be optimal, in that they find the true minimum of the cost function. Here we extend these pruning methods, and introduce two newalgorithms for segmenting data: FPOP and SNIP. Empirical results showthat FPOP is substantially faster than existing dynamic programming methods, and unlike the existing methods its computational efficiency is robust to the number of changepoints in the data. We evaluate the method for detecting copy number variations and observe that FPOP has a computational cost that is even competitive with that of binary segmentation, but can give much more accurate segmentations.
Fichier principal
Vignette du fichier
10.1007%2Fs11222-016-9636-3.pdf (992.17 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-01603953 , version 1 (29-01-2024)

Licence

Paternité - Partage selon les Conditions Initiales

Identifiants

Citer

Robert Maidstone, Toby Hocking, Guillem Rigaill, Paul Fearnhead. On optimal multiple changepoint algorithms for large data. Statistics and Computing, 2017, 27 (2), pp.519-533. ⟨10.1007/s11222-016-9636-3⟩. ⟨hal-01603953⟩
111 Consultations
3 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More