A kernel multiple change-point algorithm via model selection

From MaRDI portal
Publication:80474

DOI10.48550/ARXIV.1202.3878zbMATH Open1446.62120arXiv1202.3878MaRDI QIDQ80474FDOQ80474


Authors: Sylvain Arlot, Alain Celisse, Zaid Harchaoui, Sylvain Arlot, Alain Celisse, Zaid Harchaoui Edit this on Wikidata


Publication date: 17 February 2012

Abstract: We tackle the change-point problem with data belonging to a general set. We build a penalty for choosing the number of change-points in the kernel-based method of Harchaoui and Capp{'e} (2007). This penalty generalizes the one proposed by Lebarbier (2005) for one-dimensional signals. We prove a non-asymptotic oracle inequality for the proposed method, thanks to a new concentration result for some function of Hilbert-space valued random variables. Experiments on synthetic data illustrate the accuracy of our method, showing that it can detect changes in the whole distribution of data, even when the mean and variance are constant.


Full work available at URL: https://arxiv.org/abs/1202.3878




Recommendations




Cites Work


Cited In (27)

Uses Software





This page was built for publication: A kernel multiple change-point algorithm via model selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q80474)