- Two-step nonnegative matrix factorization algorithm for the approximate realization of hidden Markov models
- 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), Budapest, Hungary
- Book/source title
- Proceedings of the 19th International Symposium on Mathematical Theory of Networks and Systems (MTNS 2010), Budapest, Hungary
- Pages (from-to)
- Eötvös Loránd University
- Document type
- Conference contribution
- Faculty of Science (FNWI)
- Korteweg-de Vries Institute for Mathematics (KdVI)
We propose a two-step algorithm for the construction of a Hidden Markov Model (HMM) of assigned size, i.e. cardinality of the state space of the underlying Markov chain, whose n-dimensional distribution is closest in divergence to a given distribution. The algorithm is based on the factorization of a pseudo Hankel matrix, defined in terms of the given distribution, into the product of a tall and a wide nonnegative matrix. The implementation is based on the nonnegative matrix factorization (NMF) algorithm. To evaluate the performance of our algorithm we produced some numerical simulations in the context of HMM order reduction.
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.