An application of MCMC methods for the multiple change-points problem

被引:103
|
作者
Lavielle, M [1 ]
Lebarbier, E [1 ]
机构
[1] Univ Paris 11, Equipe Probabilities Stat & Modelisat, F-91400 Orsay, France
关键词
change-point detection; Gibbs sampler; Hastings-Metropolis algorithm; reversible jump; SAEM algorithm;
D O I
10.1016/S0165-1684(00)00189-4
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
We present in this paper a multiple change-point analysis for which an MCMC sampler plays a fundamental role. It is used for estimating the posterior distribution of the unknown sequence of change-points instants, and also for estimating the hyperparameters of the model. Furthermore, a slight modification of the algorithm allows one to compute the change-points sequences of highest probabilities. The so-called reversible jump algorithm is not necessary in this framework, and a very much simpler and faster procedure of simulation is proposed. We show that different interesting statistics can be derived from the posterior distribution. Indeed, MCMC is powerful for simulating joint distributions, and its use should not be restricted to the estimation of marginal posterior distributions, or posterior means. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:39 / 53
页数:15
相关论文
共 50 条