Learning Hidden Markov Models using Non-Negative Matrix Factorization
Cybenko, George, Crespi, Valentino
–arXiv.org Artificial Intelligence
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.
arXiv.org Artificial Intelligence
Jan-7-2011
- Country:
- Asia > Middle East
- Jordan (0.04)
- Europe
- Finland (0.04)
- Italy > Lombardy
- Milan (0.04)
- Middle East
- Cyprus > Ammochostos
- Famagusta (0.04)
- Northern Cyprus (0.04)
- Cyprus > Ammochostos
- North America
- Canada > Ontario
- Toronto (0.04)
- United States
- California
- Alameda County > Berkeley (0.04)
- Los Angeles County > Los Angeles (0.04)
- Illinois (0.04)
- Massachusetts > Middlesex County
- New Hampshire > Grafton County
- Hanover (0.04)
- New York (0.04)
- Virginia > Arlington County
- Arlington (0.04)
- California
- Canada > Ontario
- Asia > Middle East
- Genre:
- Instructional Material > Course Syllabus & Notes (0.46)
- Research Report (0.82)
- Industry:
- Technology: