Approximate inference in Bayesian networks using binary probability trees

Andrés Cano

doi:10.1016/j.ijar.2010.05.006

Return

Approximate inference in Bayesian networks using binary probability trees

2011-01-01

PRE

Andrés Cano *

Manuel Gómez‐Olmedo

Serafén Moral

DOI：10.1016/j.ijar.2010.05.006

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2010 Elsevier Inc. All rights reserved.

Keywords:

Bayesian networks inference

Approximate computation

Variable elimination algorithm

Deterministic algorithms

Probability trees

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.