Exact smoothing in hidden conditionally Markov switching linear models - IMT - Institut Mines-Télécom Accéder directement au contenu
Article Dans Une Revue Communications in Statistics - Theory and Methods Année : 2011

Exact smoothing in hidden conditionally Markov switching linear models

Résumé

We consider the problem of the exact calculation of smoothing in hidden switching state-space systems. There is a hidden state-space chain X, the switching chain R, and the observed chain Y. In the classical, widely used conditionally Gaussian state-space linear model (CGSSLM) the exact calculation with complexity linear in time is not feasible and different approximations have to be made. Different alternative models, in which the exact calculations are feasible, have been proposed recently. The key difference between these models and the classical ones is that R is Markovian conditionally on Y in the recent models, while it is not in the classical ones. Moreover, these different models have been extended to models in which X is no longer necessarily Markovian conditionally on (R, Y). Here, we propose a further new extension of the latter models and we derive exact computation of posterior expectation as well as posterior variance-covariance matrix with complexity polynomial in time
Fichier non déposé

Dates et versions

hal-01348048 , version 1 (22-07-2016)

Identifiants

Citer

Wojciech Pieczynski. Exact smoothing in hidden conditionally Markov switching linear models. Communications in Statistics - Theory and Methods, 2011, 40 (16), pp.2823 - 2829. ⟨10.1080/03610926.2011.562761⟩. ⟨hal-01348048⟩
34 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More