Computational methods for discrete hidden semi‐Markov chains

Yann Guédon

Applied Stochastic Models in Business and Industry, 1999, vol. 15, issue 3, 195-224

Abstract: We propose a computational approach for implementing discrete hidden semi‐Markov chains. 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 non‐stationary discrete sequences. Copyright © 1999 John Wiley & Sons, Ltd.

Date: 1999
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1526-4025(199907/09)15:33.0.CO;2-F

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:apsmbi:v:15:y:1999:i:3:p:195-224

Access Statistics for this article

More articles in Applied Stochastic Models in Business and Industry from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().