Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Learning Hidden Markov Models using Non-Negative Matrix Factorization (0809.4086v2)

Published 24 Sep 2008 in cs.LG, cs.AI, cs.IT, and math.IT

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.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. George Cybenko (7 papers)
  2. Valentino Crespi (5 papers)
Citations (33)

Summary

We haven't generated a summary for this paper yet.