Computer Science – Learning
Scientific paper
2008-09-24
Computer Science
Learning
Submitted to IEEE Transactions on Information Theory in September 2008
Scientific paper
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.
Crespi Valentino
Cybenko George
No associations
LandOfFree
Learning Hidden Markov Models using Non-Negative Matrix Factorization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Learning Hidden Markov Models using Non-Negative Matrix Factorization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Learning Hidden Markov Models using Non-Negative Matrix Factorization will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-110532