Content provided in partnership with
Estimating hidden semi-Markov chains from discrete sequences.
Journal of Computational & Graphical Statistics, September, 2003 by Yann Guedon
 |
This article addresses the estimation of hidden semi-Markov chains from nonstationary discrete sequences. Hidden semi-Markov chains are particularly useful to model the succession of homogeneous zones or segments along sequences. A discrete hidden semi-Markov chain is composed of a nonobservable state process, which is a semi-Markov chain, and a discrete output process.
- Most Popular Articles in Reference
- The importance of understanding organizational culture
- Credit card attitudes and behaviors of college students
- What factors attract foreign direct investment?
- Libraries Need Relationship Marketing - mutual interest marketing concept, ...
- How to set performance goals: employee reviews are more than annual critiques
- More »
Hidden semi-Markov chains generalize hidden Markov chains and enable the modeling of various durational structures. From an algorithmic point of view, a new forward-backward algorithm is proposed whose complexity is similar to that of the Viterbi algorithm in terms of sequence length (quadratic in the worst case in ...
Find Research Guides for:
Find Featured Titles for: Autos
Most Popular Articles in Reference
- The importance of understanding organizational culture
- Credit card attitudes and behaviors of college students
- What factors attract foreign direct investment?
- Libraries Need Relationship Marketing - mutual interest marketing concept, ...
- How to set performance goals: employee reviews are more than annual critiques
- More »