Conjugate prior relationships

The following diagram summarizes conjugate prior relationships for a number of common sampling distributions.

Arrows point from a sampling distribution to its conjugate prior distribution. The symbol near the arrow indicates which parameter the prior is unknown.

These relationships depends critically on choice of parameterization, some of which are uncommon. This page uses the parameterizations
that make the relationships simplest to state, not necessarily the most common parameterizations. See footnotes below.

Click on a distribution to see its parameterization. Click
on an arrow to see posterior parameters.

See this page for more
diagrams
 on this site including diagrams for probability and statistics, analysis, topology, and category theory. Also, please contact me if you’re interested in Bayesian
statistical consulting
.

Parameterizations

Let C(n, k)
denote the binomial
coefficient
(n, k).

The geometric distribution has only one parameter, p,
and has PMF f(x)
= p (1-p)x.

The binomial distribution with parameters n and p has
PMF f(x)
= C(n, x) px(1-p)n-x.

The negative binomial distribution with parameters r and p has
PMF f(x)
= C(r + x –
1, x)pr(1-p)x.

The Bernoulli distribution has probability of success p.

The beta distribution has PDF f(p)
= Γ(α + β) pα-1(1-p)β-1 /
(Γ(α) Γ(β)).

The exponential distribution parameterized in terms of the rate λ has PDF f(x)
= λ exp(-λ x).

The gamma distribution parameterized in terms of the rate has PDF f(x)
= βα xα-1exp(-β x)
/ Γ(α).

The Poisson distribution has one parameter λ and PMF f(x)
= exp(-λ) λx/ x!.

The normal distribution parameterized in terms of precision τ (τ = 1/σ2)

has PDF f(x)
= (τ/2π)1/2 exp( -τ(x –
μ)2/2 ).

The lognormal distribution parameterized in terms of precision τ has PDF f(x)
= (τ/2π)1/2exp( -τ(log(x)
– μ)2/2 ) / x.

Posterior parameters

For each sampling distribution, assume we have data x1, x2,
…, xn.

If the sampling distribution for x is binomial(m, p)
with m known, and the prior distribution is beta(α,
β), the posterior distribution for p is beta(α
+ Σxi,
β + mn – Σxi).
The Bernoulli is the special case of the binomial with m =
1.

If the sampling distribution for x is negative
binomial(r, p) with r known,
and the prior distribution is beta(α, β), the posterior distribution for p is beta(α
+ nr, β + Σxi).
Thegeometric is the special case of the negative binomial with r =
1.

If the sampling distribution for x is gamma(α,
β) with α known, and the prior distribution on β is gamma(α0,
β0), the posterior distribution
for β is gamma(α0 + n,
β0 + Σxi).
Theexponential is a special case of the gamma with α = 1.

If the sampling distribution for x is Poisson(λ),
and the prior distribution on λ is gamma(α0,
β0), the posterior on λ is gamma(α0 +
Σxi, β0 + n).

If the sampling distribution for x is normal(μ, τ) with τ known, and the prior distribution on μ is normal(μ0,
τ0), the posterior distribution
on μ is normal((μ0 τ0 +
τ Σxi)/(τ0 + nτ),
τ0 + nτ).

If the sampling distribution for x is normal(μ, τ) with μ known, and the prior distribution on τ is gamma(α,
β), the posterior distribution on τ is gamma(α + n/2,
(n-1)S2)
where S2 is
the sample variance.

If the sampling distribution for x is lognormal(μ, τ) with τ known, and the prior distribution on μ is normal(μ0,
τ0), the posterior distribution
on μ is normal((μ0 τ0 +
τ Πxi)/(τ0 + nτ),
τ0 +nτ).

If the sampling distribution for x is lognormal(μ,
τ) with μ known, and the prior distribution on τ is gamma(α, β), the posterior distribution on τ is gamma(α
+ n/2, (n-1)S2)
where S2 is
the sample variance.

References

A
compendium of conjugate priors
 by Daniel Fink.

See also Wikipedia’s article on conjugate
priors
.

Conjugate prior relationships的更多相关文章

  1. 共轭先验(conjugate prior)

    共轭是贝叶斯理论中的一个概念,一般共轭要说是一个先验分布与似然函数共轭: 那么就从贝叶斯理论中的先验概率,后验概率以及似然函数说起: 在概率论中有一个条件概率公式,有两个变量第一个是A,第二个是B , ...

  2. The Joys of Conjugate Priors

    The Joys of Conjugate Priors (Warning: this post is a bit technical.) Suppose you are a Bayesian rea ...

  3. 转:Conjugate prior-共轭先验的解释

    Conjugate prior-共轭先验的解释    原文:http://blog.csdn.net/polly_yang/article/details/8250161 一 问题来源: 看PRML第 ...

  4. Gibbs sampling

    In statistics and in statistical physics, Gibbs sampling or a Gibbs sampler is aMarkov chain Monte C ...

  5. Wishart distribution

    Introduction In statistics, the Wishart distribution is generalization to multiple dimensions of the ...

  6. [综] Latent Dirichlet Allocation(LDA)主题模型算法

    多项分布 http://szjc.math168.com/book/ebookdetail.aspx?cateid=1&&sectionid=983 二项分布和多项分布 http:// ...

  7. PRML读书笔记——2 Probability Distributions

    2.1. Binary Variables 1. Bernoulli distribution, p(x = 1|µ) = µ 2.Binomial distribution + 3.beta dis ...

  8. 关于Beta分布、二项分布与Dirichlet分布、多项分布的关系

    在机器学习领域中,概率模型是一个常用的利器.用它来对问题进行建模,有几点好处:1)当给定参数分布的假设空间后,可以通过很严格的数学推导,得到模型的似然分布,这样模型可以有很好的概率解释:2)可以利用现 ...

  9. [zz] 混合高斯模型 Gaussian Mixture Model

    聚类(1)——混合高斯模型 Gaussian Mixture Model http://blog.csdn.net/jwh_bupt/article/details/7663885 聚类系列: 聚类( ...

随机推荐

  1. Spring验证的错误返回------BindingResult

    Spring验证的错误返回------BindingResult 参考资料:http://www.mkyong.com/spring-mvc/spring-mvc-form-errors-tag-ex ...

  2. PostgreSQL: 一种用于生成随机字符串的方法

    create or replace function random_string(integer) returns text as $body$ select array_to_string(arra ...

  3. 一个优秀的Android应用从建项目开始

    1.项目结构 现在的MVP模式越来越流行.就默认采用了.如果项目比较小的话: app——Application Activity Fragment Presenter等的顶级父类 config——AP ...

  4. Object C学习笔记15-协议(protocol)

    在.NET中有接口的概念,接口主要用于定义规范,定义一个接口关键字使用interface.而在Object C 中@interface是用于定义一个类的,这个和.NET中有点差别.在Object C中 ...

  5. Orchard 刨析:Caching

    关于Orchard中的Caching组件已经有一些文章做了介绍,为了系列的完整性会再次对Caching组件进行一次介绍. 缓存的使用 在Orchard看到如下一段代码: 可以看到使用缓存的方法Get而 ...

  6. SQL Server2008 列名显示无效

    在SQLServer2008中,当设计(修改)表结构之后,再用SQL语句时,列名会显示无效,但执行可以通过 如下图: 原因是SQL Server的intellisense(智能感知功能)需要重新整理一 ...

  7. [BZOJ2038]小Z的袜子(莫队算法)

    题目:http://www.lydsy.com/JudgeOnline/problem.php?id=2038 分析:莫队算法 莫队算法是一种思想…… 处理问题:不带修改的区间询问 使用要求:[l-1 ...

  8. 大型网站系统架构实践(五)深入探讨web应用高可用方案

    从上篇文章到这篇文章,中间用了一段时间准备,主要是想把东西讲透,同时希望大家给与一些批评和建议,这样我才能有所进步,也希望喜欢我文章的朋友,给个赞,这样我才能更有激情,呵呵. 由于本篇要写的内容有点多 ...

  9. cookie的一些细节

    什么是 Cookie “cookie 是存储于访问者的计算机中的变量.每当同一台计算机通过浏览器请求某个页面时,就会发送这个 cookie.你可以使用 JavaScript 来创建和取回 cookie ...

  10. hdu1025 最长上升子序列 (nlogn)

    水,坑. #include<cstdio> #include<cstring> #include<iostream> #include<algorithm&g ...