Efficient Computation of the Hidden Markov Model Entropy for a Given Observation Sequence

DOI10.1109/TIT.2005.850223zbMATH Open1310.94033OpenAlexW2119174600MaRDI QIDQ3547008FDOQ3547008

Authors: Diego Hernando, George Cybenko, 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

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

Cited In (6)

• Segmentation uncertainty in multiple change-point models
• Localizing the latent structure canonical uncertainty: entropy profiles for hidden Markov models
• A novel entropy-based decoding algorithm for a generalized high-order discrete hidden Markov model
• Exploring the state sequence space for hidden Markov and semi-Markov chains
• Computation of moments for probabilistic finite-state automata
• A comparison of some criteria for states selection in the latent Markov model for longitudinal data

This page was built for publication: Efficient Computation of the Hidden Markov Model Entropy for a Given Observation Sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547008)