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 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.
Learning Bayesian Networks from Incomplete Databases
Published 1997 in Conference on Uncertainty in Artificial Intelligence
ABSTRACT
PUBLICATION RECORD
- Publication year
1997
- Venue
Conference on Uncertainty in Artificial Intelligence
- Publication date
1997-08-01
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-10 of 10 references · Page 1 of 1