A Bayesian Solution to the Multivariate Behrens—Fisher Problem
多元 Behrens–Fisher 问题的贝叶斯解法AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要属于多元正态均值比较与贝叶斯概率计算,未提供给定经济计量细分的直接依据。
多元 Behrens–Fisher 问题的贝叶斯解法AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
We consider the problem of finding the posterior probabilities of ellipsoids for the difference between two multivariate normal means. We do not require the two population covariance matrices to be equal, therefore, our results pertain to the multivariate Behrens—Fisher problem. A Hotelling T 2-like quantity is defined, and its cdf is expressed as a linear combination of the cdf's of some F distributions. This representation enables us to compute desired probabilities exactly using only one-dimensional numerical integrations. The calculation can easily be done with natural conjugate priors as well as with diffuse priors. Our main theoretical result, concerning convolutions of multivariate t distributions, is of some general interest. For the univariate case, we suggest a much simpler proof than that of Ruben (1960). We also give some bounds and approximations for the posterior probabilities of ellipsoids. The computation of these approximations requires much less computer time than the computation of the exact probabilities, even though the latter are quite straightforward. A numerical example and comments regarding the computation establish that this is an easily implemented approach to the analysis of the multivariate Behrens—Fisher problem.