AP Statistics Curriculum 2007 Bayesian Gibbs

From Socr

Revision as of 23:29, 22 October 2009 by IvoDinov (Talk | contribs)
Jump to: navigation, search

Contents

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




Translate this page:

(default)

Deutsch

Español

Français

Italiano

Português

日本語

България

الامارات العربية المتحدة

Suomi

इस भाषा में

Norge

한국어

中文

繁体中文

Русский

Nederlands

Ελληνικά

Hrvatska

Česká republika

Danmark

Polska

România

Sverige

Personal tools