AP Statistics Curriculum 2007 Bayesian Gibbs

From SOCR
Revision as of 01:08, 2 June 2009 by JayZzz (talk | contribs) (New page: Gibbs sampling is an algorithm to generate a sequence of samples from the joint probability distribution of two or more random variables. The purpose of this sequence is to approximate the...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Gibbs sampling is an algorithm to generate a sequence of samples from the joint probability distribution of two or more random variables. The purpose of this sequence is to approximate the joint distribution, or to compute an expected value. Gibbs sampling is a special case of the Metropolis-Hastings algorithm also making it an example of a Markov chain Monte Carlo algorithm.


Introduction to numerical methods

EM algorithm

Data augmentation by Monte Carlo

The Gibbs Sampler

Rejection Sampling

Metropolis Hastings Algorithm

Generalized Linear Model

Retrieved from "https://wiki.socr.umich.edu/index.php?title=AP_Statistics_Curriculum_2007_Bayesian_Gibbs&oldid=9072"