An Efficient Algorithm for Learning Bayesian Networks from Data

Authors:
Norbert Dojer
Affiliations:
(Correspd.) Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warszawa, Poland. dojer@mimuw.edu.pl
Venue:
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Year:
2010

Citing 11
Cited 0

A Bayesian Method for the Induction of Probabilistic Networks from Data

Machine Learning
Learning Bayesian Networks: The Combination of Knowledge and Statistical Data

Machine Learning
Learning hybrid Bayesian networks from data

Learning in graphical models
A Branch-and-Bound Algorithm for MDL Learning Bayesian Networks

UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Large-Sample Learning of Bayesian Networks is NP-Hard

The Journal of Machine Learning Research
Learning Bayesian Networks

Learning Bayesian Networks
BNFinder

Bioinformatics
Finding a path is harder than finding a tree

Journal of Artificial Intelligence Research
Learning polytrees

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Learning the structure of dynamic probabilistic networks

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Learning bayesian networks does not have to be NP-Hard

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose an algorithm for learning an optimal Bayesian network from data. Our method is addressed to biological applications, where usually datasets are small, and sets of random variables are large. Moreover, we assume that there is no need to examine the acyclicity of the graph. We provide polynomial bounds (with respect to the number of random variables) for time complexity of our algorithm for two generally used scoring criteria: Minimal Description Length and Bayesian-Dirichlet equivalence. Then we show how to adapt these criteria to work with continuous data and prove polynomial bounds for adapted scores. Finally, we briefly describe applications of proposed algorithm in computational biology.