Geometric-Based Pruning Rules For Change Point Detection in Multiple Independent Time Series

by   Liudmila Pishchagina, et al.

We consider the problem of detecting multiple changes in multiple independent time series. The search for the best segmentation can be expressed as a minimization problem over a given cost function. We focus on dynamic programming algorithms that solve this problem exactly. When the number of changes is proportional to data length, an inequality-based pruning rule encoded in the PELT algorithm leads to a linear time complexity. Another type of pruning, called functional pruning, gives a close-to-linear time complexity whatever the number of changes, but only for the analysis of univariate time series. We propose a few extensions of functional pruning for multiple independent time series based on the use of simple geometric shapes (balls and hyperrectangles). We focus on the Gaussian case, but some of our rules can be easily extended to the exponential family. In a simulation study we compare the computational efficiency of different geometric-based pruning rules. We show that for small dimensions (2, 3, 4) some of them ran significantly faster than inequality-based approaches in particular when the underlying number of changes is small compared to the data length.


page 1

page 2

page 3

page 4


Exact and Heuristic Approaches to Speeding Up the MSM Time Series Distance Computation

The computation of the distance of two time series is time-consuming for...

Detecting changes in slope with an L_0 penalty

Whilst there are many approaches to detecting changes in mean for a univ...

A log-linear time algorithm for constrained changepoint detection

Changepoint detection is a central problem in time series and genomic da...

Change-in-Slope Optimal Partitioning Algorithm in a Finite-Size Parameter Space

We consider the problem of detecting change-points in univariate time se...

Pruning Algorithms for Low-Dimensional Non-metric k-NN Search: A Case Study

We focus on low-dimensional non-metric search, where tree-based approach...

Data segmentation algorithms: Univariate mean change and beyond

Data segmentation a.k.a. multiple change point analysis has received con...

The Hyvärinen scoring rule in Gaussian linear time series models

Likelihood-based estimation methods involve the normalising constant of ...

Please sign up or login with your details

Forgot password? Click here to reset