Learning Bayesian networks from incomplete data with stochastic search algorithms

  • Authors:
  • James W. Myers;Kathryn Blackmond Laskey;Tod Levitt

  • Affiliations:
  • George Mason University, Fairfax, VA;George Mason University, Fairfax, VA;IET, Setauket, NY

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper describes stochastic search approaches, including a new stochastic algorithm and an adaptive mutation operator, for learning Bayesian networks from incomplete data. This problem is characterized by a huge solution space with a highly multimodal landscape. State-of-the-art approaches all involve using deterministic approaches such as the elrpectation-maximization algorithm. These approaches are guaranteed to find local maxima, but do not explore the landscape for other modes. Our approach evolves structure and the missing data. We compare our stochastic algorithms and show they all produce accurate results.