Optimizing inference in Bayesian networks and semiring valuation algebras

  • Authors:
  • Michael Wachter;Rolf Haenni;Marc Pouly

  • Affiliations:
  • University of Bern, Switzerland;Bern University of Applied Sciences, Switzerland;University of Fribourg, Switzerland

  • Venue:
  • MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

Previous work on context-specific independence in Bayesian networks is driven by a common goal, namely to represent the conditional probability tables in a most compact way. In this paper, we argue from the view point of the knowledge compilation map and conclude that the language of Ordered Binary Decision Diagrams (OBDD) is the most suitable one for representing probability tables, in addition to the language of Algebraic Decision Diagrams (ADD). We thus suggest the replacement of the current practice of using tree-based or rule-based representations. This holds not only for inference in Bayesian networks, but is more generally applicable in the generic framework of semiring valuation algebras, which can be applied to solve a variety of inference and optimization problems in different domains.