Structure learning of Bayesian networks using constraints

  • de Campos C
  • Zeng Z
  • Ji Q
  • 55


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


This paper addresses exact learning of Bayesian network structure from data and expert's knowledge based on score functions that are decomposable. First, it describes useful properties that strongly reduce the time and memory costs of many known methods such as hill-climbing, dynamic programming and sampling variable orderings. Secondly, a branch and bound algorithm is presented that integrates parameter and structural constraints with data in a way to guarantee global optimality with respect to the score function. It is an any-time procedure because, if stopped, it provides the best current solution and an estimation about how far it is from the global solution. We show empirically the advantages of the properties and the constraints, and the applicability of the algorithm to large data sets (up to one hundred variables) that cannot be handled by other current methods (limited to around 30 variables).

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Cassio P. de Campos

  • Zhi Zeng

  • Qiang Ji

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free