Compiling Relational Bayesian Networks for Exact Inference

Manfred Jaeger, Mark Chavira, Adnan Darwiche

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearch

381 Downloads (Pure)

Abstract

We describe 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 the successful compilation, and efficient inference, on relational Bayesian networks whose {\primula}--generated propositional instances have thousands of variables, and whose jointrees have clusters with hundreds of variables.
Original languageEnglish
Title of host publicationProceedings of the Second European Workshop on Probabilistic Graphical Models
EditorsP. Lucas (Editor)
Publication date2004
Publication statusPublished - 2004
EventSECOND EUROPEAN WORKSHOP ON  PROBABILISTIC GRAPHICALMODELS 2004 (PGM'04) - Leiden, Netherlands
Duration: 4 Oct 20048 Oct 2004
Conference number: 2

Conference

ConferenceSECOND EUROPEAN WORKSHOP ON  PROBABILISTIC GRAPHICALMODELS 2004 (PGM'04)
Number2
Country/TerritoryNetherlands
CityLeiden
Period04/10/200408/10/2004

Fingerprint

Dive into the research topics of 'Compiling Relational Bayesian Networks for Exact Inference'. Together they form a unique fingerprint.

Cite this