Wiki:Gibbs sampling or Gibbs sampler is an algorithm to generate a sequence of samples from the joint probability distribution of two or more random variables. The purpose of such a sequence is to approximate the joint distribution, or to compute an integral (such as an expected value).
MCMC有很多算法,其中比较流行的是Metropolis-Hastings Algorithm,Gibbs Sampling是Metropolis-Hastings Algorithm的一种特殊情况。MCMC算法的关键是两个函数:
(1)转移函数
(2)选择函数
适用于处理不完备信息,当联合分布不明确,而各个变量的条件分布已知的情况。
根据其他变量的当前值,依次对分布的每个变量生成一个实例。