A hybrid anytime algorithm for the construction of causal models from sparse data

  • Authors:
  • Denver Dash;Marek J. Druzdzel

  • Affiliations:
  • Department of Physics and Astronomy and Decision Systems Laboratory, University of Pittsburgh, Pittsburgh, PA and Decision Systems Laboratory at the University of Pittsburgh, Pittsburgh, PA;Decision Systems Laboratory, School of Information Sciences, University of Pittsburgh, Pittsburgh, PA

  • Venue:
  • UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a hybrid constraint-based/ Bayesian algorithm for learning causal networks in the presence of sparse data. The algorithm searches the space of equivalence classes of models (essential graphs) using a heuristic based on conventional constraint-based techniques. Each essential graph is then converted into a directed acyclic graph and scored using a Bayesian scoring metric. Two variants of the algorithm are developed and tested using data from randomly generated networks of sizes from 15 to 45 nodes with data sizes ranging from 250 to 2000 records. Both variations are compared to, and found to consistently outperform two variations of greedy search with restarts.