A new polynomial time algorithm for bayesian network structure learning

Authors:
Sanghack Lee;Jihoon Yang;Sungyong Park
Affiliations:
Diquest Inc., Seoul, Korea;Department of Computer Science, Sogang University, Seoul, Korea;Department of Computer Science, Sogang University, Seoul, Korea
Venue:
ADMA'06 Proceedings of the Second international conference on Advanced Data Mining and Applications
Year:
2006

Citing 6
Cited 0

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Estimating the errors on measured entropy and mutual information

Physica D
Causality: models, reasoning, and inference

Causality: models, reasoning, and inference
Learning Bayesian networks from data: an information-theory based approach

Artificial Intelligence
Genetic wrappers for feature selection in decision tree induction and variable ordering in Bayesian network structure learning

Information Sciences: an International Journal - Special issue: Soft computing data mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a new algorithm called SCD for learning the structure of a Bayesian network. The algorithm is a kind of constraint-based algorithm. By taking advantage of variable ordering, it only requires polynomial time conditional independence tests and learns the exact structure theoretically. A variant which adopts the Bayesian Dirichlet scoring function is also presented for practical purposes. The performance of the algorithms are analyzed in several aspects and compared with other existing algorithms. In addition, we define a new evaluation metric named EP power which measures the proportion of errors caused by previously made mistakes in the learning sequence, and use the metric for verifying the robustness of the proposed algorithms.