Selective review of offline change point detection methods
About
This article presents a selective survey of algorithms for the offline detection of multiple change points in multivariate time series. A general yet structuring methodological strategy is adopted to organize this vast body of work. More precisely, detection algorithms considered in this review are characterized by three elements: a cost function, a search method and a constraint on the number of changes. Each of those elements is described, reviewed and discussed separately. Implementations of the main algorithms described in this article are provided within a Python package called ruptures.
Charles Truong, Laurent Oudre, Nicolas Vayatis• 2018
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Change Point Detection | Cov jumps | RI97 | 6 | |
| Change Point Detection | magic | Record Index (RI)97 | 6 | |
| Change Point Detection | WISDM | F1-score94 | 6 | |
| Change Point Detection | higgs | F1-score52 | 6 | |
| Change Point Detection | Variance jumps | RI98 | 6 | |
| Change Point Detection | Cov jumps | F1 Score82 | 6 | |
| Change Point Detection | Kepler | F1-score88 | 6 | |
| Change Point Detection | magic | F1-score77 | 6 | |
| Change Point Detection | Mean jumps | RI0.98 | 6 | |
| Change Point Detection | MNIST | Record Index (RI)97 | 6 |
Showing 10 of 23 rows