SparsityBoost: A New Scoring Function for Learning Bayesian Network Structure

Abstract

We give a new consistent scoring function for structure learning of Bayesian networks. In contrast to traditional approaches to scorebased structure learning, such as BDeu or MDL, the complexity penalty that we propose is data-dependent and is given by the probability that a conditional independence test correctly shows that an edge cannot exist. What really distinguishes this new scoring function from earlier work is that it has the property of becoming computationally easier to maximize as the amount of data increases. We prove a polynomial sample complexity result, showing that maximizing this score is guaranteed to correctly learn a structure with no false edges and a distribution close to the generating distribution, whenever there exists a Bayesian network which is a perfect map for the data generating distribution. Although the new score can be used with any search algorithm, we give empirical results showing that it is particularly effective when used together with a linear programming relaxation approach to Bayesian network structure learning.

Appears in Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence (UAI2013)

References in corpus (2)

• Bayesian network learning with cutting planes
• On the Sample Complexity of Learning Bayesian Networks

Cited by in corpus (6)

• Exposing the Probabilistic Causal Structure of Discrimination
• Evaluating structure learning algorithms with a balanced scoring function
• A Model of Selective Advantage for the Efficient Inference of Cancer Clonal Evolution
• Size of Interventional Markov Equivalence Classes in Random DAG Models
• Efficient Bayesian network structure learning via local Markov boundary search
• Incorporating Type II Error Probabilities from Independence Tests into Score-Based Learning of Bayesian Network Structure