Sciweavers

Share
IJCAI
2007

Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs

8 years 7 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi-linear functions (MLFs) based on Zero-suppressed BDDs (ZBDDs), which are the graph-based representation of combinatorial item sets. Our method is different from the original approach of Darwiche et. al which encodes BNs into Conjunctive Normal Forms (CNFs) and then translates CNFs into factored MLFs. Our approach directly translates a BN into a set of factored MLFs using ZBDD-based symbolic probability calculation. The MLF may have an exponential size, but our ZBDD-based data structure provides a compact factored form of the MLF, and arithmetic operations can be executed in a time almost linear to the ZBDD size. Our method is not necessary to generate the MLF for the whole network, but we can extract MLFs for only a part of network related to the query, to avoid unnecessary calculation of redundant terms of ...
Shin-ichi Minato, Ken Satoh, Taisuke Sato
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where IJCAI
Authors Shin-ichi Minato, Ken Satoh, Taisuke Sato
Comments (0)
books