Construction of Bayesian Network Structures From Data: A Brief Survey and an Efficient Algorithm

Construction of Bayesian Network Structures From Data: A Brief Survey and an Efficient Algorithm (1995)

by Moninder Singh , Marco Valtorta

Citations:

70 - 8 self

User correction supplied by mph

Datum	Value	Source
TITLE	Construction of Bayesian Network Structures From Data: A Brief Survey and an Efficient Algorithm	user correction
AUTHOR NAME	Moninder Singh	user correction
AUTHOR AFFIL	Department of Computer Science, University of South Carolina,	user correction
AUTHOR ADDR	Columbia, South Carolina	user correction
AUTHOR NAME	Marco Valtorta	user correction
AUTHOR AFFIL	Department of Computer Science, University of South Carolina,	user correction
AUTHOR ADDR	Columbia, South Carolina	user correction
ABSTRACT	Previous algorithms for the recovery of Bayesian belief network structures from data have been either highly dependent on conditional independence (CI) tests, or have required on ordering on the nodes to be supplied by the user. We present an algorithm that integrates these two approaches: CI tests are used to generate an ordering on the nodes from the database, which is then used to recover the underlying Bayesian network structure using a non-Cl-test-based method. Results of the evaluation of the algorithm on a number of databases (e.g., ALARM, LED, and SOYBEAN) are presented. We also discuss some algorithm performance issues and open problems.	SVM HeaderParse 0.2
YEAR	1995	user correction
CITATIONS	30 found	ParsCit 1.0