IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v15y1999i3p195-224.html
   My bibliography  Save this article

Computational methods for discrete hidden semi‐Markov chains

Author

Listed:
  • Yann Guédon

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.

Suggested Citation

  • Yann Guédon, 1999. "Computational methods for discrete hidden semi‐Markov chains," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 15(3), pages 195-224, July.
    • Handle: RePEc:wly:apsmbi:v:15:y:1999:i:3:p:195-224
    DOI: 10.1002/(SICI)1526-4025(199907/09)15:33.0.CO;2-F
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1526-4025(199907/09)15:33.0.CO;2-F
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1526-4025(199907/09)15:33.0.CO;2-F?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmbi:v:15:y:1999:i:3:p:195-224. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.