Localizing the latent structure canonical uncertainty: entropy profiles for hidden Markov models
From MaRDI portal
Publication:2631384
DOI10.1007/s11222-014-9494-9zbMath1342.62139arXiv1202.6545MaRDI QIDQ2631384
Jean-Baptiste Durand, Yann Guédon
Publication date: 29 July 2016
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1202.6545
60J22: Computational methods in Markov chains
62M05: Markov processes: estimation; hidden Markov models
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
Cites Work
- Unnamed Item
- Unnamed Item
- Exploring the state sequence space for hidden Markov and semi-Markov chains
- An entropy criterion for assessing the number of clusters in a mixture model
- Analyzing growth components in trees
- Exploring the latent segmentation space for the assessment of multiple change-point models
- Inference in hidden Markov models.
- Efficient Computation of the Hidden Markov Model Entropy for a Given Observation Sequence
- Baum's forward-backward algorithm revisited
- Hidden Markov processes
- A soft output hybrid algorithm for ML/MAP sequence estimation
- Computational Methods for Hidden Markov Tree Models—An Application to Wavelet Trees
- Elements of Information Theory
- Hidden Markov Models for Time Series