# AP Statistics Curriculum 2007 Bayesian Gibbs

### From Socr

(Difference between revisions)

(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...) |
|||

Line 1: | Line 1: | ||

- | + | ==[[EBook | Probability and Statistics Ebook]] - Expectation Maximization Estimation, Gibbs Sampling and Monte Carlo Simulations== | |

+ | 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== | ==Introduction to numerical methods== | ||

- | |||

==EM algorithm== | ==EM algorithm== | ||

- | |||

==Data augmentation by Monte Carlo== | ==Data augmentation by Monte Carlo== | ||

- | |||

Line 23: | Line 21: | ||

==Metropolis Hastings Algorithm== | ==Metropolis Hastings Algorithm== | ||

- | |||

==Generalized Linear Model== | ==Generalized Linear Model== | ||

+ | |||

+ | |||

+ | ==See also== | ||

+ | * [[EBook#Chapter_III:_Probability |Probability Chapter]] | ||

+ | |||

+ | ==References== | ||

+ | * [http://repositories.cdlib.org/socr/EM_MM Expectation Maximization and Mixture Modeling Tutorial] (December 9, 2008). Statistics Online Computational Resource. Paper EM_MM, http://repositories.cdlib.org/socr/EM_MM. | ||

+ | |||

+ | <hr> | ||

+ | * SOCR Home page: http://www.socr.ucla.edu | ||

+ | |||

+ | {{translate|pageName=http://wiki.stat.ucla.edu/socr/index.php?title=AP_Statistics_Curriculum_2007_Bayesian_Gibbs}} |

## Revision as of 23:31, 22 October 2009

## Probability and Statistics Ebook - Expectation Maximization Estimation, Gibbs Sampling and Monte Carlo Simulations

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

## See also

## References

- Expectation Maximization and Mixture Modeling Tutorial (December 9, 2008). Statistics Online Computational Resource. Paper EM_MM, http://repositories.cdlib.org/socr/EM_MM.

- SOCR Home page: http://www.socr.ucla.edu

Translate this page: