Work

A Scoring Function for Learning Bayesian Networks based on Mutual Information and Conditional Independence Tests

Year: 2006
Type: article
Abstract: We propose a new scoring function for learning Bayesian networks from data using score+search algorithms. This is based on the concept of mutual information and exploits some well-known properties of this measure in a novel way. Essentially, a statistical independence test based on the \nchi-square distribution, associated with the mutual information measure, together with a property of additive decomposition of this measure, are combined in order to measure the degree of interaction between each variable and its parent variables in the network. The result is a non-Bayesian \nscoring function called MIT (mutual information tests) which belongs to the family of scores based on information theory. The MIT score also represents a penalization of the Kullback-Leibler divergence between the joint probability distributions associated with a candidate network and with the available data set. Detailed results of a complete experimental evaluation of the proposed scoring \nfunction and its comparison with the well-known K2, BDeu and BIC/MDL scores are also presented.
Language: English
Open Access status: green
OpenAlex ID: W2142390772
FWCI: 3.614
Cites: 68
Cited by: 384
Related to: 10