Article,
Hidden semi-Markov models
Artificial Intelligence, 174 (2): 215-243 (February 2010)
DOI: 10.1016/j.artint.2009.11.011
Abstract
As an extension to the popular hidden Markov model (HMM), a hidden semi-Markov model (HSMM) allows the underlying stochastic process to be a semi-Markov chain. Each state has variable duration and a number of observations being produced while in the state. This makes it suitable for use in a wider range of applications. Its forward–backward algorithms can be used to estimate/update the model parameters, determine the predicted, filtered and smoothed probabilities, evaluate goodness of an observation sequence fitting to the model, and find the best state sequence of the underlying stochastic process. Since the \HSMM\ was initially introduced in 1980 for machine recognition of speech, it has been applied in thirty scientific and engineering areas, such as speech recognition/synthesis, human activity recognition/prediction, handwriting recognition, functional \MRI\ brain mapping, and network anomaly detection. There are about three hundred papers published in the literature. An overview of \HSMMs\ is presented in this paper, including modelling, inference, estimation, implementation and applications. It first provides a unified description of various \HSMMs\ and discusses the general issues behind them. The boundary conditions of \HSMM\ are extended. Then the conventional models, including the explicit duration, variable transition, and residential time of HSMM, are discussed. Various duration distributions and observation models are presented. Finally, the paper draws an outline of the applications.
