Recursive identification of HMMs with observations in a finite set
- 1 December 1995
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 216-221
- https://doi.org/10.1109/cdc.1995.478681
Abstract
International audienceWe consider the problem of identification of a partially observed finite-state Markov chain, based on observations in a finite set. We first investigate the asymptotic behaviour of the maximum likelihood estimate (MLE) for the transition probabilities, as the number of observations increases to infinity. In particular, we exhibit the associated contrast function, and discuss consistency issues. Based on this expression, we design a recursive identification algorithm, which converges to the set of local minima of the contrast functionKeywords
This publication has 5 references indexed in Scilit:
- On-line identification of hidden Markov models via recursive prediction error techniquesIEEE Transactions on Signal Processing, 1994
- On-line estimation of hidden Markov model parameters based on the Kullback-Leibler information measureIEEE Transactions on Signal Processing, 1993
- Analysis of an identification algorithm arising in the adaptive estimation of Markov chainsMathematics of Control, Signals, and Systems, 1990
- Adaptive Algorithms and Stochastic ApproximationsPublished by Springer Nature ,1990
- Probabilistic Functions of Finite State Markov ChainsThe Annals of Mathematical Statistics, 1969