Inference and model choice for sequentially ordered hidden Markov models

Nicolas Chopin

Journal of the Royal Statistical Society Series B, 2007, vol. 69, issue 2, 269-284

Abstract: Summary. The system equation of a hidden Markov model is rewritten to label the components by order of appearance, and to make explicit the random behaviour of the number of components, mt. We argue that this reformulation is often a good way to achieve identifiability, as it facilitates the interpretation of the posterior density, and the estimation of the number of components that have appeared in a given sample. We develop a sequential Monte Carlo algorithm for estimating the reformulated model, which relies on particle filtering and Gibbs sampling. Our algorithm has a computational cost that is similar to that of a Markov chain Monte Carlo sampler and is much less likely to be affected by label switching, i.e. the possibility of becoming trapped in a local mode of the posterior density. The extension to transdimensional priors is also considered. The approach is illustrated by two real data examples.

Date: 2007
References: View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9868.2007.00588.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jorssb:v:69:y:2007:i:2:p:269-284

Ordering information: This journal article can be ordered from
http://ordering.onli ... 1111/(ISSN)1467-9868

Access Statistics for this article

Journal of the Royal Statistical Society Series B is currently edited by P. Fryzlewicz and I. Van Keilegom

More articles in Journal of the Royal Statistical Society Series B from Royal Statistical Society Contact information at EDIRC.
Bibliographic data for series maintained by Wiley Content Delivery ().