Approximate inference in Bayesian networks using binary probability trees

详细信息    查看全文

• 作者：André ; s Cano ; Manuel Gé ; mez-Olmedo ; Serafé ; n Moral
• 关键词：Bayesian networks inference ; Approximate computation ; Variable elimination algorithm ; Deterministic algorithms ; Probability trees
• 刊名：International Journal of Approximate Reasoning
• 出版年：2011
• 出版时间：January 2011
• 年：2011
• 卷：52
• 期：1
• 页码：49-62
• 全文大小：932 K

文摘

The present paper introduces a new kind of representation for the potentials in a Bayesian network: Binary Probability Trees. They enable the representation of context-specific independences in more detail than probability trees. This enhanced capability leads to more efficient inference algorithms for some types of Bayesian networks. This paper explains the procedure for building a binary probability tree from a given potential, which is similar to the one employed for building standard probability trees. It also offers a way of pruning a binary tree in order to reduce its size. This allows us to obtain exact or approximate results in inference depending on an input threshold. This paper also provides detailed algorithms for performing the basic operations on potentials (restriction, combination and marginalization) directly to binary trees. Finally, some experiments are described where binary trees are used with the variable elimination algorithm to compare the performance with that obtained for standard probability trees.