Learning Bayesian Networks from Incomplete Data Based on EMI Method

  • Authors:
  • Fengzhan Tian;Hongwei Zhang;Yuchang Lu

  • Affiliations:
  • -;-;-

  • Venue:
  • ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Currently, there are few efficient methods in practice forlearning Bayesian networks from incomplete data, whichaffects their use in real world data mining applications.This paper presents a general-duty method that estimatesthe (Conditional) Mutual Information directly from incompletedatasets, EMI. EMI starts by computing the intervalestimates of a joint probability of a variable set, which areobtained from the possible completions of the incompletedataset. And then computes a point estimate via a convexcombination of the extreme points, with weights dependingon the assumed pattern of missing data. Finally, based onthese point estimates, EMI gets the estimated (conditional)Mutual Information. This paper also applies EMI to the dependencyanalysis based learning algorithm by J. Cheng soas to efficiently learn BNs with incomplete data. The experimentalresults on Asia and Alarm networks show that EMIbased algorithm is much more efficient than two search&scoring based algorithms, SEM and EM-EA algorithms. Interms of accuracy, EMI based algorithm is more accuratethan SEM algorithm, and comparable with EM-EA algorithm.