DocumentCode :
3108938
Title :
Recursive estimation of Hidden Markov Models
Author :
Gerencsér, László ; Molnár-Saska, Gábor ; Orlovits, Zsanett
Author_Institution :
MTA SZTAKI, Computer and Automation Institute of the Hungarian Academy of Sciences, 1111 Budapest, Hungary gerencser@sztaki.hu
fYear :
2005
fDate :
12-15 Dec. 2005
Firstpage :
1209
Lastpage :
1214
Abstract :
A recursive estimation method for Hidden Markov Models has been proposed in [24]. As suggested there the proposed recursive algorithm could be analyzed via the theory of stochastic approximations developed in [4]. The purpose of this note is to verify the basic probabilistic conditions of [4], given in Part II, Chapter 1 of [4]. For this purpose we consider a general class of Markov models in which a simple Markov process is passed through an exponentially stable non-linear system. The general theory is relatively easily applied to HMMs extended by their filter process and their derivatives, see [1].
Keywords :
Algorithm design and analysis; Automation; Convergence; Filtering theory; Filters; Hidden Markov models; Markov processes; Recursive estimation; State-space methods; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on
Print_ISBN :
0-7803-9567-0
Type :
conf
DOI :
10.1109/CDC.2005.1582323
Filename :
1582323
Link To Document :
بازگشت