Computational methods for discrete hidden semi-Markov chains
Hidden Markov chains emerged in the 1970s in engineering and have since become a major tool for both pattern recognition applications such as speech or handwriting recognition or biological sequence analysis. Semi-Markov processes (or Markov renewal processes) have been applied for a long time in such diverse fields as biostatistics, operations research, reliability, queueing theory or manpower planning. Hidden semi-Markov chains with non-parametric state occupancy distributions were first proposed in the field of speech recognition by Ferguson at the beginning of the 1980s [see, for example, \textit{J. D. Ferguson} (ed.), Proc. Symp. on the Applications of Hidden Markov Models to Text and Speech (Princeton, NJ, 1980)]. A computational approach for implementing discrete hidden semi-Markov chains is proposed. A discrete hidden semi-Markov chain is composed of a non-observable or hidden process which is a finite semi-Markov chain and a discrete observable process. Hidden semi-Markov chains possess both the flexibility of hidden Markov chains for approximating complex probability distributions and the flexibility of semi-Markov chains for representing temporal structures. Efficient algorithms for computing characteristic distributions organized according to the intensity, interval and counting points of view are described. The proposed computational approach in conjunction with statistical inference algorithms previously proposed makes discrete hidden semi-Markov chains a powerful model for the analysis of samples of nonstationary discrete sequences.
- Hidden semi-Markov models. Theory, algorithms and applications
- Hidden hybrid Markov/semi-Markov chains
- The evaluation problem in discrete semi-hidden Markov models
- Hidden semi-Markov models
- Computational discrete time Markov chain with correlated transition probabilities
- Finite-dimensional models for hidden Markov chains
- Semi-hidden Markov models for generation and analysis of sequences
- scientific article; zbMATH DE number 846906
- Exploring the state sequence space for hidden Markov and semi-Markov chains
- A hidden semi-Markov model with missing data and multiple observation sequences for mobility tracking.
- Semi-hidden Markov models for generation and analysis of sequences
- The evaluation problem in discrete semi-hidden Markov models
- Distributions associated with general runs and patterns in hidden Markov models
- Viterbi algorithms for hidden semi-Markov models with application to DNA analysis
- Generalized linear mixed hidden models in longitudinal settings: a Bayesian approach
- Hidden hybrid Markov/semi-Markov chains
- Hidden semi-Markov model-based methodology for multi-sensor equipment health diagnosis and prognosis
- Semi-Markov chains and hidden semi-Markov models toward applications. Their use in reliability and DNA analysis.
- Unsupervised segmentation of new semi-Markov chains hidden with long dependence noise
This page was built for publication: Computational methods for discrete hidden semi-Markov chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4512134)