Statistics – Computation
Scientific paper
2010-09-07
Statistics
Computation
26 pages - preprint accepted in 20th February 2012 for publication in Computational Statistics and Data Analysis (please cite
Scientific paper
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.
Bousquet Nicolas
Fu Shuai
Pasanisi Alberto
No associations
LandOfFree
Estimating Discrete Markov Models From Various Incomplete Data Schemes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Estimating Discrete Markov Models From Various Incomplete Data Schemes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimating Discrete Markov Models From Various Incomplete Data Schemes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-704483