Abstract
Computing the most likely state sequence from an observation sequence is an important problem with many applications. The generalized Viterbi algorithm, a direct extension of the Viterbi algorithm for hidden Markov models (HMMs), has been used to find the most likely state sequence for hierarchical HMMs. However, the generalized Viterbi algorithm finds the most likely whole level state sequence rather than the most likely upper level state sequence. In this paper, we propose a marginalized Viterbi algorithm, which finds the most likely upper level state sequence by marginalizing lower level state sequences. We show experimentally that the marginalized Viterbi algorithm is more accurate than the generalized Viterbi algorithm in terms of upper level state sequence estimation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fine, S., Singer, Y., Tishby, N.: The hierarchical hidden Markov model: Analysis and applications. Machine Learning 32(1), 41–62 (1998)
Jurafsky, D., Martin, J.H.: Speeach and Language Processing, 2nd edn. Prentice Hall (2008)
Murphy, K., Paskin, M.: Linear time inference in hierarchical HMMs. Advances in Neural Information Processing Systems 14, 833–840 (2001)
Nguyen, N.T., Phung, D.Q., Venkatesh, S., Bui, H.: Learning and detecting activities from movement trajectories using the hierarchical hidden Markov models. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 955–960 (2005)
Phung, D.Q., Duong, T.V., Venkatesh, S., Bui, H.H.: Topic transition detection using hierarchical hidden Markov and semi-Markov models. In: Proceedings of 13th ACM International Conference on Multimedia, pp. 11–20 (2005)
Rabiner, L., Juang, B.H.: Fundamentals of Speech Recognition. Prentice Hall (1993)
Reynolds, D.A.: Speaker identification and verification using gaussian mixture speaker models. Speech Communication 17, 91–108 (1995)
Skounakis, M., Craven, M., Ray, S.: Hierarchical hidden Markov models for information extraction. In: Proceedings of 18th International Joint Conference on Artificial Intelligence, pp. 427–433 (2003)
Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Transactions on Information Theory 13(2), 260–269 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hayashi, A., Iwata, K., Suematsu, N. (2013). Finding the Most Likely Upper Level State Sequence for Hierarchical HMMs. In: Dediu, AH., MartÃn-Vide, C., Mitkov, R., Truthe, B. (eds) Statistical Language and Speech Processing. SLSP 2013. Lecture Notes in Computer Science(), vol 7978. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39593-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-39593-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39592-5
Online ISBN: 978-3-642-39593-2
eBook Packages: Computer ScienceComputer Science (R0)