Menu Content/Inhalt
December 2018
26 27 28 29 30 1 2
3 4 5 6 7 8 9
10 11 12 13 14 15 16
17 18 19 20 21 22 23
24 25 26 27 28 29 30
31 1 2 3 4 5 6

Search on Site

Events Print
previous year previous month next month next year
See by year See by month See by week See Today Search Jump to month
Sylvain Arlot, Paris-Sud Print
Thursday, 04 October 2018, 12:15 - 13:15

Sylvain Arlot, Université Paris-Sud

Consistent Change-point Detection with Kernels

Preprint 1 - Preprint 2 

Abstract : We tackle the change-point problem with data belonging to a general set. We propose a penalty for choosing the number of change-points in the kernel-based method of Harchaoui and Cappe (2007). This penalty generalizes the one proposed for one dimensional signals by Lebarbier (2005).
By showing a new concentration result in Hilbert spaces, we prove it satisfies a non-asymptotic oracle inequality. Furthermore, our procedure retrieves the correct number of change-points with high probability, provided the penalty is well chosen, and it 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 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.
Experiments on synthetic and real data illustrate the accuracy of our method, showing it can detect changes in the whole distribution of data, even when the mean and variance are constant.


Location: R42.2.113
Contact: Nancy De Munck - This e-mail address is being protected from spam bots, you need JavaScript enabled to view it