Successive restrictions algorithm in bayesian networks

  • Authors:
  • Linda Smail;Jean Pierre Raoult

  • Affiliations:
  • L.A.M.A. Laboratory, Marne-la-Vallée University, Champs sur Marne, Marne-la-Vallée, France;L.A.M.A. Laboratory, Marne-la-Vallée University, Champs sur Marne, Marne-la-Vallée, France

  • Venue:
  • IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

Given a Bayesian network relative to a set I of discrete random variables, we are interested in computing the probability distribution PA or the conditional probability distribution PA|B, where A and B are two disjoint subsets of I. The general idea of the algorithm of successive restrictions is to manage the succession of summations on all random variables out of the target A in order to keep on it a structure less constraining than the Bayesian network, but which allows saving in memory ; that is the structure of Bayesian Network of Level Two.