mlsanityData to 7 Oct 2026

Inductive Conformal Martingales for Change-Point Detection

arXiv 1706.03415 ↗First posted 11 Jun 2017stat.ML stat.CO stat.MEcited by 17

Not on the map. Why?

Abstract (arXiv)

We consider the problem of quickest change-point detection in data streams. Classical change-point detection procedures, such as CUSUM, Shiryaev-Roberts and Posterior Probability statistics, are optimal only if the change-point model is known, which is an unrealistic assumption in typical applied problems. Instead we propose a new method for change-point detection based on Inductive Conformal Martingales, which requires only the independence and identical distribution of observations. We compare the proposed approach to standard methods, as well as to change-point detection oracles, which model a typical practical situation when we have only imprecise (albeit parametric) information about pre- and post-change data distributions. Results of comparison provide evidence that change-point detection based on Inductive Conformal Martingales is an efficient tool, capable to work under quite general conditions unlike traditional approaches.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Jun 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 2; 2023: 0; 2024: 4; 2025: 5; 2026: 3.

17 papers.

Sort: