Learning hidden Markov models using nonnegative matrix factorization

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

Abstract

The Baum-Welch algorithm together with its derivatives and variations has been the main technique for learning hidden Markov models (HMMs) from observational data. We present an HMM learning algorithm based on the nonnegative matrix factorization (NMF) of higher order Markovian statistics that is structurally different from the Baum-Welch and its associated approaches. The described algorithm supports estimation of the number of recurrent states of an HMM and iterates the NMF algorithm to improve the learned HMM parameters. Numerical examples are provided as well. © 2011 IEEE.

Cite

CITATION STYLE

APA

Cybenko, G., & Crespi, V. (2011). Learning hidden Markov models using nonnegative matrix factorization. IEEE Transactions on Information Theory, 57(6), 3963–3970. https://doi.org/10.1109/TIT.2011.2132490

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