Theory refinement on Bayesian networks
Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence
Optimal structure identification with greedy search
The Journal of Machine Learning Research
Exact Bayesian Structure Discovery in Bayesian Networks
The Journal of Machine Learning Research
Discriminative versus generative parameter and structure learning of Bayesian network classifiers
ICML '05 Proceedings of the 22nd international conference on Machine learning
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
Structure learning of Bayesian networks using constraints
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Optimal Search on Clustered Structural Constraint for Learning Bayesian Network Structure
The Journal of Machine Learning Research
Exact structure discovery in Bayesian networks with less space
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Large-sample learning of bayesian networks is NP-hard
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Characteristic imsets for learning Bayesian network structure
International Journal of Approximate Reasoning
Fast monotone summation over disjoint sets
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Causal discovery of dynamic bayesian networks
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Finding optimal Bayesian networks using precedence constraints
The Journal of Machine Learning Research
An ensemble of Bayesian networks for multilabel classification
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fast monotone summation over disjoint sets
Information Processing Letters
Learning optimal bayesian networks: a shortest path perspective
Journal of Artificial Intelligence Research
Learning Bayesian network structure: Towards the essential graph by integer linear programming tools
International Journal of Approximate Reasoning
Hi-index | 0.00 |
This paper addresses the problem of learning Bayesian network structures from data based on score functions that are decomposable. It describes properties that strongly reduce the time and memory costs of many known methods without losing global optimality guarantees. These properties are derived for different score criteria such as Minimum Description Length (or Bayesian Information Criterion), Akaike Information Criterion and Bayesian Dirichlet Criterion. Then a branch-and-bound algorithm is presented that integrates structural constraints with data in a way to guarantee global optimality. As an example, structural constraints are used to map the problem of structure learning in Dynamic Bayesian networks into a corresponding augmented Bayesian network. Finally, we show empirically the benefits of using the properties with state-of-the-art methods and with the new algorithm, which is able to handle larger data sets than before.