Skip to Main content Skip to Navigation
Journal articles

Estimating discrete Markov models from various incomplete data schemes

Abstract : The parameters of a discrete stationary Markov model are transition probabilities between states. Traditionally, data consist in sequences of observed states for a given number of individuals over the whole observation period. In such a case, the estimation of transition probabilities is straightforwardly made by counting one-step moves from a given state to another. In many real-life problems, however, the inference is much more difficult as state sequences are not fully observed, namely the state of each individual is known only for some given values of the time variable. A review of the problem is given, focusing on Monte Carlo Markov Chain (MCMC) algorithms to perform Bayesian inference and evaluate posterior distributions of the transition probabilities in this missing-data framework. Leaning on the dependence between the rows of the transition matrix, an adaptive MCMC mechanism accelerating the classical Metropolis-Hastings algorithm is then proposed and empirically studied.
Document type :
Journal articles
Complete list of metadata
Contributor : Erwan Le Pennec Connect in order to contact the contributor
Submitted on : Thursday, February 6, 2014 - 2:16:17 PM
Last modification on : Sunday, June 26, 2022 - 12:00:46 PM

Links full text




Alberto Pasanisi, Shuai Fu, Nicolas Bousquet. Estimating discrete Markov models from various incomplete data schemes. Computational Statistics and Data Analysis, Elsevier, 2012, 56 (9), pp.2609-2625. ⟨10.1016/j.csda.2012.02.027⟩. ⟨hal-00942772⟩



Record views