Improved estimation of Hidden Markov model parameters from multiple observation sequences

26Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The huge popularity of Hidden Markov models in pattern recognition is due to the ability to "learn" model parameters from an observation sequence through Baum-Welch and other re-estimation procedures. In the case of HMM parameter estimation from an ensemble of observation sequences, rather than a single sequence, we require techniques for finding the parameters which maximize the likelihood of the estimated model given the entire set of observation sequences. The importance of this study is that HMMs with parameters estimated from multiple observations are shown to be many orders of magnitude more probable than HMM models learned from any single observation sequence - thus the effectiveness of HMM "learning" is greatly enhanced. In this paper, we present techniques that usually find models significantly more likely than Rabiner's well-known method on both seen and unseen sequences. © 2002 IEEE.

Cite

CITATION STYLE

APA

Davis, R. I. A., Lovell, B. C., & Caelli, T. (2002). Improved estimation of Hidden Markov model parameters from multiple observation sequences. In Proceedings - International Conference on Pattern Recognition (Vol. 16, pp. 168–171). https://doi.org/10.1109/icpr.2002.1048264

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free