Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

IJAR
2006

favoriteEmaildiscussreport

125views more IJAR 2006»

Compiling relational Bayesian networks for exact inference

13 years 4 months ago

Compiling relational Bayesian networks for exact inference

Download www.cs.ucla.edu

We describe in this paper a system for exact inference with relational Bayesian networks as defined in the publicly available Primula tool. The system is based on compiling propositional instances of relational Bayesian networks into arithmetic circuits and then performing online inference by evaluating and differentiating these circuits in time linear in their size. We report on experimental results showing successful compilation and efficient inference on relational Bayesian networks, whose Primula

Mark Chavira, Adnan Darwiche, Manfred Jaeger

Real-time Traffic

Exact Inference | IJAR 2006 | Propositional Instances | Relational Bayesian Networks |

claim paper

Related Content

» Solving MAP Exactly by Searching on Compiled Arithmetic Circuits

» Logical Compilation of Bayesian Networks with Discrete Variables

» Temporally Invariant Junction Tree for Inference in Dynamic Bayesian Network

» Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference

» An Analysis of Bayesian Network ModelApproximation Techniques

» On the Complexity of Probabilistic Inference in Singly Connected Bayesian Networks

» Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact...

» Efficient Distributed Bayesian Reasoning via Targeted Instantiation of Variables

» Node Level Primitives for Parallel Exact Inference

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	IJAR
Authors	Mark Chavira, Adnan Darwiche, Manfred Jaeger

Comments (0)