Optimal Detection of Changepoints With a Linear Computational Cost

Lancaster University

Indexed inarxivcrossref

Abstract

In this article, we consider the problem of detecting multiple changepoints in large datasets. Our focus is on applications where the number of changepoints will increase as we collect more data: for example, in genetics as we analyze 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 minimizing a cost function over possible numbers and locations of changepoints. This includes several established procedures for detecting changing points, such as penalized likelihood and minimum description length. We introduce a new method for finding the minimum of such cost functions and hence the optimal number and…

Citation impact

2,432
total citations
FWCI
61.01
Percentile
100%
References
41
Citations per year

Authors

3

Topics & keywords

Keywords
  • Computer science
  • Quadratic equation
  • Focus (optics)
  • Algorithm
  • Binary number
  • Function (biology)
  • Mathematical optimization
  • Mathematics
No related works found for this paper.

Funding