A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models

DOI10.1109/TIT.2006.887076MaRDI QIDQ3548233zbMATHOpenAlexFDO

Authors Li Xie, Valery Ugrinovskii, Ian R. Petersen

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.2006.887076

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Information theory (general) (94A15)

Recommendations

• On computing the total variation distance of hidden Markov models
• Hidden Markov processes
• scientific article; zbMATH DE number 2081009
• On identification of states of a sequence generated by a hidden Markov model
• Equivalence of state representations for hidden Markov models

Cited in

(3)

• Event-triggered minimax state estimation with a relative entropy constraint
• On computing the total variation distance of hidden Markov models
• Probability Distance Based Compression of Hidden Markov Models

This page was built for publication: A Posteriori Probability Distances Between Finite-Alphabet Hidden Markov Models

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