IDEAS home Printed from https://ideas.repec.org/a/spr/compst/v34y2019i3d10.1007_s00180-019-00877-z.html
   My bibliography  Save this article

Recursive estimation of multivariate hidden Markov model parameters

Author

Listed:
  • Jūratė Vaičiulytė

    (Vilnius University)

  • Leonidas Sakalauskas

    (Klaipėda University)

Abstract

This article addresses a recursive parameter estimation algorithm for a hidden Markov model (HMM). The work focuses on an HMM with multiple states that are assumed to follow from a multivariate Gaussian distribution. The novelty of this study lies in a state transition probability calculation technique that simplifies the application of the backward stage of the forward–backward algorithm. For sequential observation analysis, the complexity of the created recursive algorithm for learning the HMM parameters is merely linear. Meanwhile, the classical Baum–Welch algorithm has second order complexity; therefore, it cannot be applied in online analysis situations. The properties of the proposed recursive expectation–maximization (EM) algorithm were explored by a computer simulation solving test examples and demonstrate that this algorithm can be efficiently applied to solve online tasks related to HMM parameter estimation.

Suggested Citation

  • Jūratė Vaičiulytė & Leonidas Sakalauskas, 2019. "Recursive estimation of multivariate hidden Markov model parameters," Computational Statistics, Springer, vol. 34(3), pages 1337-1353, September.
    • Handle: RePEc:spr:compst:v:34:y:2019:i:3:d:10.1007_s00180-019-00877-z
    DOI: 10.1007/s00180-019-00877-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00180-019-00877-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00180-019-00877-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:compst:v:34:y:2019:i:3:d:10.1007_s00180-019-00877-z. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.