...
首页> 外文期刊>Theory and Decision >COUNTABLE ADDITIVITY AND THE FOUNDATIONS OF BAYESIAN STATISTICS
【24h】

COUNTABLE ADDITIVITY AND THE FOUNDATIONS OF BAYESIAN STATISTICS

机译:可数可加性和贝叶斯统计的基础

获取原文
获取原文并翻译 | 示例
           

摘要

At a very fundamental level an individual (or a computer) can process only a finite amount of information in a finite time. We can therefore model the possibilities facing such an observer by a tree with only finitely many arcs leaving each node. There is a natural field of events associated with this tree, and we show that any finitely additive probability measure on this field will also be countably additive. Hence when considering the foundations of Bayesian statistics we may as well assume countable additivity over a σ -field of events.
机译:从根本上讲,个人(或计算机)在有限的时间内只能处理有限数量的信息。因此,我们可以通过一棵树来模拟面对这样一个观察者的可能性,而只有有限的许多弧离开每个节点。这棵树有一个自然的事件场,我们证明了在该场上的任何有限加性概率测度也将是可数加性的。因此,在考虑贝叶斯统计的基础时,我们还可以假设事件的σ场具有可数的加性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号