An online sequential algorithm for the estimation of transition probabilities for jump Markov linear systems |
| |
Authors: | Umut Orguner [Author Vitae],Mü beccel Demirekler [Author Vitae] |
| |
Affiliation: | Department of Electrical and Electronics Engineering, Middle East Technical University, 06531 Ankara, Turkey |
| |
Abstract: | This paper describes a new method to estimate the transition probabilities associated with a jump Markov linear system. The new algorithm uses stochastic approximation type recursions to minimize the Kullback-Leibler divergence between the likelihood function of the transition probabilities and the true likelihood function. Since the calculation of the likelihood function of the transition probabilities is impossible, an incomplete data paradigm, which has been previously applied to a similar problem for hidden Markov models, is used. The algorithm differs from the existing algorithms in that it assumes that the transition probabilities are deterministic quantities whereas the existing approaches consider them to be random variables with prior distributions. |
| |
Keywords: | Jump Markov linear systems Kullback-Leibler distance measure Transition probability Stochastic approximation |
本文献已被 ScienceDirect 等数据库收录! |