Online Expectation Maximization based algorithms for inference in hidden Markov models

Details Online Expectation Maximization based algorithms for inference in hidden Markov models Online Expectation Maximization based algorithms for inference in hidden Markov models

2011-08-19

arxiv.org/abs/1108.3968v2

Mathematics

Statistics Theory

Scientific paper

The Expectation Maximization (EM) algorithm is a versatile tool for model parameter estimation in latent data models. When processing large data sets or data stream however, EM becomes intractable since it requires the whole data set to be available at each iteration of the algorithm. In this contribution, a new generic online EM algorithm for model parameter inference in general Hidden Markov Model is proposed. This new algorithm updates the parameter estimate after a block of observations is processed (online). The convergence of this new algorithm is established, and the rate of convergence is studied showing the impact of the block size. An averaging procedure is also proposed to improve the rate of convergence. Finally, practical illustrations are presented to highlight the performance of these algorithms in comparison to other online maximum likelihood procedures.

Affiliated with

Also associated with

No associations

Rating

Online Expectation Maximization based algorithms for inference in hidden Markov models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Online Expectation Maximization based algorithms for inference in hidden Markov models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Online Expectation Maximization based algorithms for inference in hidden Markov models will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-108498