Optimal Detection of Changepoints With a Linear Computational Cost¶
Killick, R., Fearnhead, P., & Eckley, I. A. (2012). Optimal Detection of Changepoints With a Linear Computational Cost. Journal of the American Statistical Association, 107(500), 1590-1598.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Change-Point Segmentation
- Select the set of change points under a penalty that caps how many cuts are allowed, using standard algorithms — CUSUM for a mean shift, binary segmentation, or PELT for an optimal set.
This sourceIntroduces PELT as an exact method for selecting multiple changepoints by minimizing a penalized cost and compares it with binary segmentation.
- Select the set of change points under a penalty that caps how many cuts are allowed, using standard algorithms — CUSUM for a mean shift, binary segmentation, or PELT for an optimal set.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a09c4a4c6124 · see in the full table