most citedLazy Propagation in Junction Trees

54 citations · 122 across the 5 of their papers we have counts for

collaborators
Showing cs.AIShow all

6 papers · 1 filter

cs.AI201354 cited

Lazy Propagation in Junction Trees

Anders L. Madsen, Finn Verner Jensen

The efficiency of algorithms using secondary structures for probabilistic inference in Bayesian networks can be improved by exploiting independence relations induced by evidence an…

cs.AI201343 cited

Lazy Evaluation of Symmetric Bayesian Decision Problems

Anders L. Madsen, Finn Verner Jensen

Solving symmetric Bayesian decision problems is a computationally intensive task to perform regardless of the algorithm used. In this paper we propose a method for improving the ef…

cs.AI201322 cited

Solving Influence Diagrams using HUGIN, Shafer-Shenoy and Lazy Propagation

Anders L. Madsen, Dennis Nilsson

In this paper we compare three different architectures for the evaluation of influence diagrams: HUGIN, Shafer-Shenoy, and Lazy Evaluation architecture. The computational complexit…

cs.AI2012

An Empirical Evaluation of Possible Variations of Lazy Propagation

Anders L. Madsen

As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of p…

cs.AI20123 cited

A Differential Semantics of Lazy AR Propagation

Anders L. Madsen

In this paper we present a differential semantics of Lazy AR Propagation (LARP) in discrete Bayesian networks. We describe how both single and multi dimensional partial derivatives…

cs.AI2012

Belief Update in CLG Bayesian Networks With Lazy Propagation

Anders L. Madsen

In recent years Bayesian networks (BNs) with a mixture of continuous and discrete variables have received an increasing level of attention. We present an architecture for exact bel…