Improvements to message computation in lazy propagation

  • Authors:
  • A. L. Madsen

  • Affiliations:
  • HUGIN EXPERT A/S, Gasværksvej 5, DK-9000 Aalborg, Denmark

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Even though existing algorithms for belief update in Bayesian networks (BNs) have exponential time and space complexity, belief update in many real-world BNs is feasible. However, in some cases the efficiency of belief update may be insufficient. In such cases minor improvements in efficiency may be important or even necessary to make a task tractable. This paper introduces two improvements to the message computation in Lazy propagation (LP): (1) we introduce myopic methods for sorting the operations involved in a variable elimination using arc-reversal and (2) extend LP with the any-space property. The performance impacts of the methods are assessed empirically.