Consistent change-point detection with kernels - Archive ouverte HAL Access content directly
Journal Articles Electronic Journal of Statistics Year : 2018

Consistent change-point detection with kernels


In this paper we study the kernel change-point algorithm (KCP) proposed by Arlot, Celisse and Harchaoui (2012), which aims at locating an unknown number of change-points in the distribution of a sequence of independent data taking values in an arbitrary set. The change-points are selected by model selection with a penalized kernel empirical criterion. We provide a non-asymptotic result showing that, with high probability, the KCP procedure retrieves the correct number of change-points, provided that the constant in the penalty is well-chosen; in addition, KCP estimates the change-points location at the optimal rate. As a consequence, when using a characteristic kernel, KCP detects all kinds of change in the distribution (not only changes in the mean or the variance), and it is able to do so for complex structured data (not necessarily in $\mathbb{R}^d$). Most of the analysis is conducted assuming that the kernel is bounded; part of the results can be extended when we only assume a finite second-order moment.
Fichier principal
Vignette du fichier
arxiv_submission_20170628.pdf (659.18 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01416704 , version 1 (14-12-2016)
hal-01416704 , version 2 (28-06-2017)



Damien Garreau, Sylvain Arlot. Consistent change-point detection with kernels. Electronic Journal of Statistics , 2018, 12 (2), pp.4440-4486. ⟨hal-01416704v2⟩
352 View
205 Download



Gmail Facebook X LinkedIn More