arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1411.6300cs.AI
收藏

离散贝叶斯网络:精确后验边缘分布

Discrete Bayesian Networks: The Exact Posterior Marginal Distributions

California State University, Fullerton(加州州立大学富勒顿分校)

Do Le Paul Minh

摘要:

在贝叶斯网络中,我们希望评估查询变量的边际概率,这可能取决于某些证据变量的观测值。在这里,我们首先提出了我们的“边界算法”,它将BN转换为有向链。对于多叉树,我们详细介绍了Peot & Shachter(1991)的“修正多叉树算法”,并在边界算法框架内进行了一些修改。最后,我们提出了我们的“无父多叉树方法”,它与边界算法相结合,将任何贝叶斯网络转换为多叉树,使我们的推理的复杂性与网络的大小无关,并与其证据和查询变量的数量呈线性关系。本文中的所有量都具有概率解释。

英文摘要:

In a Bayesian network, we wish to evaluate the marginal probability of a query variable, which may be conditioned on the observed values of some evidence variables. Here we first present our "border algorithm," which converts a BN into a directed chain. For the polytrees, we then present in details, with some modifications and within the border algorithm framework, the "revised polytree algorithm" by Peot & Shachter (1991). Finally, we present our "parentless polytree method," which, coupled with the border algorithm, converts any Bayesian network into a polytree, rendering the complexity of our inferences independent of the size of network, and linear with the number of its evidence and query variables. All quantities in this paper have probabilistic interpretations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑