pith. sign in

arxiv: 0809.4086 · v2 · pith:SEQD7X76new · submitted 2008-09-24 · 💻 cs.LG · cs.AI· cs.IT· math.IT

Learning Hidden Markov Models using Non-Negative Matrix Factorization

classification 💻 cs.LG cs.AIcs.ITmath.IT
keywords algorithmfactorizationlearningmatrixnon-negativebaum-welshhiddenmarkov
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.