Computational methods for discrete hidden semi-markov chains

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.

Bibliographic Details

Main Author:	Guédon, Yann
Format:	article biblioteca
Language:	eng
Subjects:	U10 - Informatique, mathématiques et statistiques, F50 - Anatomie et morphologie des plantes, méthode statistique, modèle mathématique, plante, croissance, modélisation, http://aims.fao.org/aos/agrovoc/c_7377, http://aims.fao.org/aos/agrovoc/c_24199, http://aims.fao.org/aos/agrovoc/c_5993, http://aims.fao.org/aos/agrovoc/c_3394, http://aims.fao.org/aos/agrovoc/c_230ab86c,
Online Access:	http://agritrop.cirad.fr/392186/ http://agritrop.cirad.fr/392186/1/ID392186.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!