๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computational issues in parameter estimation for stationary hidden Markov models

โœ Scribed by Jan Bulla; Andreas Berzel

Book ID
105855223
Publisher
Springer
Year
2007
Tongue
English
Weight
396 KB
Volume
23
Category
Article
ISSN
0943-4062

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Almost sure parameter estimation and con
Almost sure parameter estimation and convergence rates for hidden Markov models
โœ R.J. Elliott; J.B. Moore ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 220 KB

A continuous-time v,~rsion of Kronecker's Lemma is established and used to give rates of convergence for parameter estimates in hidden Ma::kov models. (~) 1997 Elsevier Science B.V.

The semi-relaxed algorithm for estimatin
The semi-relaxed algorithm for estimating parameters of hidden Markov models
โœ Li Deng ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 489 KB

For hidden Markov model (HMM) based speech recognition where the basic speech unit is smaller than the recognizer's output unit, the standard full Baum-Welch re-estimation procedure for the HMM training is very costly in computation. This is hecause it requires evaluation of the HMM output densities