R&D

Learning Bayesian Networks from Incomplete Data with Stochastic Search Algorithms

Citation: Myers, J.W., K.B. Laskey and T.S. Levitt, "Learning Bayesian Networks from Incomplete Data with Stochastic Search Algorithms", Uncertainty in Artificial Intelligence, Morgan-Kaufmann Publishers, 1999.

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 expectation-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.

For more information, contact IET

Back