HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Using penalized contrasts for the change-point problem

Marc Lavielle 1
1 SELECT - Model selection in statistical learning
LMO - Laboratoire de Mathématiques d'Orsay, Inria Saclay - Ile de France
Abstract : A methodology for model selection based on a penalized contrast is developed. This methodology is applied to the change-point problem, for estimating the number of change points and their location. We aim to complete previous asymptotic results by constructing algorithms that can be used in diverse practical situations. First, we propose an adaptive choice of the penalty function for automatically estimating the dimension of the model, that is, the number of change points. In a Bayesian framework, we define the posterior distribution of the change-point sequence as a function of the penalized contrast. MCMC procedures are available for sampling this posterior distribution. The parameters of this distribution are estimated with a stochastic version of EM algorithm (SAEM). An application to EEG analysis and some Monte-Carlo experiments illustrate these algorithms.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Friday, May 19, 2006 - 9:08:40 PM
Last modification on : Wednesday, April 20, 2022 - 3:37:37 AM
Long-term archiving on: : Sunday, April 4, 2010 - 9:40:56 PM


  • HAL Id : inria-00070662, version 1


Marc Lavielle. Using penalized contrasts for the change-point problem. RR-5339, INRIA. 2004, pp.18. ⟨inria-00070662⟩



Record views


Files downloads