Efficient Computation of the Hidden Markov Model Entropy for a Given Observation Sequence
From MaRDI portal
Publication:3547008
DOI10.1109/TIT.2005.850223zbMath1310.94033MaRDI QIDQ3547008
George Cybenko, Diego Hernando, Valentino Crespi
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.850223
94A13: Detection theory in information and communication theory
Related Items
Segmentation uncertainty in multiple change-point models, Exploring the state sequence space for hidden Markov and semi-Markov chains, A novel entropy-based decoding algorithm for a generalized high-order discrete hidden Markov model, A comparison of some criteria for states selection in the latent Markov model for longitudinal data, Localizing the latent structure canonical uncertainty: entropy profiles for hidden Markov models, Computation of moments for probabilistic finite-state automata