Abstract

We present new algorithms that aim at estimating the parameters of a latent variable process in an on-line manner. This new class of on-line algorithms is inspired by Monte Carlo Markov chain (MCMC) methods whose use has been mainly restricted to static problems, i.e., for which the set of observations is fixed. The main interest of this new class of algorithms is that it combines MCMC and particle filtering techniques, for which extensive know-how and literature are now available.

Full Text
Paper version not known

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