arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1303.5440cs.AI
收藏

贝叶斯网计算中三角剖分问题的回避

Sidestepping the Triangulation Problem in Bayesian Net Computations

University of British Columbia(不列颠哥伦比亚大学)

Nevin Lianwen Zhang, David L. Poole

摘要:

本文提出了一种新的计算贝叶斯网后验概率的方法,它避开了三角剖分问题。当前的技术状态是团树传播方法。当贝叶斯网络的底层图被三角化时,这种方法将其集团排列成一棵树,并通过在该树中适当地传递消息来计算后验概率。每个集团中的计算只是直接边缘化。当底层图未被三角化时,必须首先通过添加边对其进行三角化。被称为三角问题,问题的最佳甚至是?好吗?三角测量被证明是困难的。在本文中,我们提出了第一次分解贝叶斯网到更小的组件,利用Tarjan的算法分解无向图在其所有的最小完全分离。然后,将组件排列成树,并通过在该树中适当地传递消息来计算后验概率。每个分量的计算都是通过从头开始重复整个过程来进行的。这样就避开了三角测量的问题。

英文摘要:

This paper presents a new approach for computing posterior probabilities in Bayesian nets, which sidesteps the triangulation problem. The current state of art is the clique tree propagation approach. When the underlying graph of a Bayesian net is triangulated, this approach arranges its cliques into a tree and computes posterior probabilities by appropriately passing around messages in that tree. The computation in each clique is simply direct marginalization. When the underlying graph is not triangulated, one has to first triangulated it by adding edges. Referred to as the triangulation problem, the problem of finding an optimal or even a ?good? triangulation proves to be difficult. In this paper, we propose to first decompose a Bayesian net into smaller components by making use of Tarjan's algorithm for decomposing an undirected graph at all its minimal complete separators. Then, the components are arranged into a tree and posterior probabilities are computed by appropriately passing around messages in that tree. The computation in each component is carried out by repeating the whole procedure from the beginning. Thus the triangulation problem is sidestepped.

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

↑