The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
On optimal multiple changepoint algorithms for large data
Open accessAbstract
Many common approaches to detecting changepoints, for example based on statistical criteria such as penalised likelihood or minimum description length, can be formulated in terms of minimising a cost over segmentations. We focus on a class of dynamic programming algorithms that can solve the resulting minimisation problem exactly, and thus find the optimal segmentation under the given statistical criteria. The standard implementation of these dynamic programming methods have a computational cost that scales at least quadratically in the length of the time-series. Recently pruning ideas have been suggested that can speed up the dynamic programming algorithms, whilst still being guaranteed to be optimal, in that they find the true minimum of the cost function. Here we extend these pruning methods, and introduce two new algorithms for segmenting data: FPOP and SNIP. Empirical results show that FPOP is substantially faster than existing dynamic programming methods, and unlike the existing methods its computational efficiency is robust to the number of changepoints in the data. We evaluate the method for detecting copy number variations and observe that FPOP has a computational cost that is even competitive with that of binary segmentation, but can give much more accurate segmentations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Review and Comparison of Changepoint Detection Techniques for Climate Data
Reeves, J., Chen, J., Wang, X. L., Lund, R., & Lu, Q. Q. (2007) · Journal of Applied Meteorology and Climatology · doi:10.1175/jam2493.1 · Cited by 638
Zhang, N. R., & Siegmund, D. O. (2007) · Biometrics · doi:10.1111/j.1541-0420.2006.00662.x · Cited by 407 · cited 3×
“Changepoint methods are widely used in this area (Zhang and Siegmund, 2007; Olshen et al., 2004; Picard et al., 2011) and moreover tumour microarray data has been used as a basis for benchmarking changepoint techniques both in terms of accuracy (Hocking et al.”
BackgroundMethod
Cited by
Selective review of offline change point detection methods
Truong, C., Oudre, L., & Vayatis, N. (2020) · Signal Processing · doi:10.1016/j.sigpro.2019.107299 · Cited by 1,338
Proteome-wide prediction of the functional impact of missense variants with ProteoCast
Abakarova, M., Freiberger, M. I., Liehrmann, A., Rera, M., & Laine, E. (2026) · Nature Communications · doi:10.1038/s41467-026-72140-1 · Cited by 5
ProteoCast: a web server to predict, validate, and interpret missense variant effects
(2026) · doi:10.1016/j.jmb.2026.169657 · Cited by 1
Metadata
- Authors
- Maidstone, R., Hocking, T., Rigaill, G., & Fearnhead, P.
- Venue
- Statistics and Computing
- Published
- 2016-02-15
- Volume
- 27
- Issue
- 2
- Pages
- 519-533
- ISSN
- 0960-3174 (ISSN-L)
- 1573-1375
- OpenAlex
- W2141954357
- Cited by
- 187
- References
- 2
- FWCI
- 14.67
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On optimal multiple changepoint algorithms for large data. https://app.cochat.ai/papers/10.1007/s11222-016-9636-3
- The paper
- Maidstone, R., Hocking, T., Rigaill, G., & Fearnhead, P. (2017). On optimal multiple changepoint algorithms for large data. Statistics and Computing. https://doi.org/10.1007/s11222-016-9636-3
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.