Back to Search
Start Over
Recursive identification of HMMs with observations in a finite set
- Source :
- Proceedings of the 34th Conference on Decision and Control, New Orleans 1995, Proceedings of the 34th Conference on Decision and Control, New Orleans 1995, IEEE--CSS, Dec 1995, New Orleans, United States. pp.216-221, ⟨10.1109/CDC.1995.478681⟩
- Publication Year :
- 2002
- Publisher :
- IEEE, 2002.
-
Abstract
- International audience; We 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 function.
- Subjects :
- 0209 industrial biotechnology
Mathematical optimization
Markov chain
020206 networking & telecommunications
02 engineering and technology
Expression (mathematics)
[MATH.MATH-PR]Mathematics [math]/Probability [math.PR]
Maxima and minima
Set (abstract data type)
Identification (information)
020901 industrial engineering & automation
Consistency (statistics)
0202 electrical engineering, electronic engineering, information engineering
Applied mathematics
Hidden Markov model
Finite set
Mathematics
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- Proceedings of 1995 34th IEEE Conference on Decision and Control
- Accession number :
- edsair.doi.dedup.....2da7102a18822faad09bdc06af0f0565