Optimized Algorithm for Learning Bayesian Network from Data

  • Authors:
  • Fédia Khalfallah;Khaled Mellouli

  • Affiliations:
  • -;-

  • Venue:
  • ECSQARU '95 Proceedings of the European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present an algorithm for learning the most probable structure of a Bayesian Network from a database of cases. Starting from two previous algorithms, K2 of Cooper and Herskovits, and B of Buntine, we developed a new algorithm that relaxes the assumption of total ordering on the nodes needed by K2 and has less computations than B. To improve our algorithm, we added some heuristics and an interactive process with the user.