DocumentCode :
2415125
Title :
Recursive Maximum Likelihood Estimation for Hidden Semi-Markov Models
Author :
Squire, Kevin ; Levinson, Stephen E.
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana-Champaign, Urbana, IL
fYear :
2005
fDate :
28-28 Sept. 2005
Firstpage :
329
Lastpage :
334
Abstract :
The term hidden semi-Markov model (HSMM) refers to a large class of stochastic models developed to address some of the shortcomings of hidden Markov models (HMMs). As with HMMs, the underlying sequence of states of a process is modelled as a discrete Markov chain. Unlike HMMs, each state in an HSMM can emit a variable length sequence of observations, with many ways to model duration and observation densities. Parameter estimation in HSMMs is typically done using EM or Viterbi (dynamic programming) algorithms. These algorithms require batch processing of large amounts of data, and so are not useful for online learning. To address this issue, we present here a recursive maximum-likelihood estimation (RMLE) algorithm for online estimation of HSMM parameters, based on a similar method developed for HMMs
Keywords :
dynamic programming; hidden Markov models; maximum likelihood estimation; recursive estimation; Viterbi algorithm; batch processing; discrete Markov chain; dynamic programming; hidden Markov models; hidden semiMarkov models; parameter estimation; recursive maximum likelihood estimation; stochastic models; Dynamic programming; Heuristic algorithms; Hidden Markov models; Mathematical model; Maximum likelihood estimation; Parameter estimation; Recursive estimation; Solid modeling; Stochastic processes; Viterbi algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Machine Learning for Signal Processing, 2005 IEEE Workshop on
Conference_Location :
Mystic, CT
Print_ISBN :
0-7803-9517-4
Type :
conf
DOI :
10.1109/MLSP.2005.1532923
Filename :
1532923
Link To Document :
بازگشت