Optimal detection of changepoints with a linear computational cost

From MaRDI portal
Publication:4904735

DOI10.1080/01621459.2012.737745zbMATH Open1258.62091arXiv1101.1438OpenAlexW1975684011WikidataQ105583949 ScholiaQ105583949MaRDI QIDQ4904735FDOQ4904735


Authors: Rebecca Killick, Paul Fearnhead, Idris A. Eckley Edit this on Wikidata


Publication date: 31 January 2013

Published in: Journal of the American Statistical Association (Search for Journal in Brave)

Abstract: We consider the problem of detecting multiple changepoints in large data sets. Our focus is on applications where the number of changepoints will increase as we collect more data: for example in genetics as we analyse larger regions of the genome, or in finance as we observe time-series over longer periods. We consider the common approach of detecting changepoints through minimising a cost function over possible numbers and locations of changepoints. This includes several established procedures for detecting changing points, such as penalised likelihood and minimum description length. We introduce a new method for finding the minimum of such cost functions and hence the optimal number and location of changepoints that has a computational cost which, under mild conditions, is linear in the number of observations. This compares favourably with existing methods for the same problem whose computational cost can be quadratic or even cubic. In simulation studies we show that our new method can be orders of magnitude faster than these alternative exact methods. We also compare with the Binary Segmentation algorithm for identifying changepoints, showing that the exactness of our approach can lead to substantial improvements in the accuracy of the inferred segmentation of the data.


Full work available at URL: https://arxiv.org/abs/1101.1438




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)

Uses Software





This page was built for publication: Optimal detection of changepoints with a linear computational cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904735)