DeepAI

# On Pruning for Score-Based Bayesian Network Structure Learning

Many algorithms for score-based Bayesian network structure learning (BNSL) take as input a collection of potentially optimal parent sets for each variable in a data set. Constructing these collections naively is computationally intensive since the number of parent sets grows exponentially with the number of variables. Therefore, pruning techniques are not only desirable but essential. While effective pruning exists for the Bayesian Information Criterion (BIC), current results for the Bayesian Dirichlet equivalent uniform (BDeu) score reduce the search space very modestly, hampering the use of (the often preferred) BDeu. We derive new non-trivial theoretical upper bounds for the BDeu score that considerably improve on the state of the art. Since the new bounds are efficient and easy to implement, they can be promptly integrated into many BNSL methods. We show that gains can be significant in multiple UCI data sets so as to highlight practical implications of the theoretical advances.

• 5 publications
• 15 publications
• 6 publications
07/19/2017

### Entropy-based Pruning for Learning Bayesian Networks using BIC

For decomposable score-based structure learning of Bayesian networks, ex...
05/10/2020

### HNet: Graphical Hypergeometric Networks

Motivation: Real-world data often contain measurements with both continu...
08/04/2020

### Structure Learning from Related Data Sets with a Hierarchical Bayesian Score

Score functions for learning the structure of Bayesian networks in the l...
01/27/2011

### Bayesian Network Structure Learning with Permutation Tests

In literature there are several studies on the performance of Bayesian n...
06/27/2012

### Smoothness and Structure Learning by Proxy

As data sets grow in size, the ability of learning methods to find struc...
06/07/2017

### On learning the structure of Bayesian Networks and submodular function maximization

Learning the structure of dependencies among multiple random variables i...
06/08/2020

### Approximate learning of high dimensional Bayesian network structures via pruning of Candidate Parent Sets

Score-based algorithms that learn Bayesian Network (BN) structures provi...