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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call