Tech Report

Learning Bayesian Networks from Incomplete Databases

Bayesian approaches to learn the graphical structure of Bayesian Belief Networks (BBNs) from databases share the assumption that the database is complete, that is, no entry is reported as unknown. Attempts to relax this assumption often involve the use of expensive iterative methods to discriminate among different structures. This paper introduces a deterministic method to learn the graphical structure of a BBN from a possibly incomplete database. Experimental evaluations show a significant robustness of this method and a remarkable independence of its execution time from the number of missing data.

1. Knowledge Media Institute, The Open University.

2. Department of Actuarial Science and Statistics, City University.

ID: kmi-97-06

Date: 1997

Author(s): Marco Ramoni and Paola Sebastiani

Resources:

View By

Other Publications

Latest Seminar
Microsoft Research Cambridge

Actions and their Consequences: Implicit Interactions with Machine Learned Knowledge Bases

More Details

CONTACT US

Knowledge Media Institute
The Open University
Walton Hall
Milton Keynes
MK7 6AA
United Kingdom

Tel: +44 (0)1908 653800

Fax: +44 (0)1908 653169

Email: KMi Support

COMMENT

If you have any comments, suggestions or general feedback regarding our website, please email us at the address below.

Email: KMi Development Team