The INI has a new website!

This is a legacy webpage. Please visit the new site to ensure you are seeing up to date information.

Skip to content



Computationally Efficient Algorithms for Detecting Changepoints

Fearnhead, P (Lancaster University)
Thursday 16 January 2014, 09:30-10:00

Seminar Room 1, Newton Institute


We consider algorithms that can obtained the optimal segmentation of data under approaches such as penalised likelihood. The penalised likelihood criteria requires the user to specify a penalty value, and the choice of penalty will affect the number of changepoints that are detected. We show how it is possible to obtain the optimal segmentation for all penalty values across a continuous range. The computational complexity of this approach can linear in the number of data points, and linear in the difference in the number of changepoints between the optimal segmentations for the smallest and largest penalty values. The algorithm can be used to find optimal segmentations under the minimum description length criteria in a much more efficient manner than using the segment neighbourhood algorithm.


[pdf ]


The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.

Back to top ∧