• DocumentCode
    1525037
  • Title

    Learning Hidden Markov Models Using Nonnegative Matrix Factorization

  • Author

    Cybenko, George ; Crespi, Valentino

  • Author_Institution
    Thayer Sch. of Eng., Dartmouth Coll., Hanover, NH, USA
  • Volume
    57
  • Issue
    6
  • fYear
    2011
  • fDate
    6/1/2011 12:00:00 AM
  • Firstpage
    3963
  • Lastpage
    3970
  • Abstract
    The Baum-Welch algorithm together with its derivatives and variations has been the main technique for learning hidden Markov models (HMMs) from observational data. We present an HMM learning algorithm based on the nonnegative matrix factorization (NMF) of higher order Markovian statistics that is structurally different from the Baum-Welch and its associated approaches. The described algorithm supports estimation of the number of recurrent states of an HMM and iterates the NMF algorithm to improve the learned HMM parameters. Numerical examples are provided as well.
  • Keywords
    hidden Markov models; matrix decomposition; Baum-Welch algorithm; Markovian statistics; learning hidden Markov models; nonnegative matrix factorization; Accuracy; Computational modeling; Hidden Markov models; Markov processes; Probability distribution; Hidden Markov models (HMMs); machine learning; nonnegative matrix factorization (NMF);
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2011.2132490
  • Filename
    5773017