An online sequential algorithm for the estimation of transition probabilities forjump Markov linear systems

Orguner U. , Demirekler M.

AUTOMATICA, cilt.42, sa.10, ss.1735-1744, 2006 (SCI İndekslerine Giren Dergi) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 42 Konu: 10
  • Basım Tarihi: 2006
  • Doi Numarası: 10.1016/j.automatica.2006.05.002
  • Dergi Adı: AUTOMATICA
  • Sayfa Sayıları: ss.1735-1744


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. (C) 2006 Elsevier Ltd. All rights reserved.