Timezone: »

Advances in Learning Bayesian Networks of Bounded Treewidth
Siqi Nie · Denis Maua · Cassio P de Campos · Qiang Ji

Thu Dec 11 07:10 AM -- 07:35 AM (PST) @ Level 2, room 210

This work presents novel algorithms for learning Bayesian networks of bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed integer linear programming formulations for structure learning and treewidth computation. The approximate method consists in sampling k-trees (maximal graphs of treewidth k), and subsequently selecting, exactly or approximately, the best structure whose moral graph is a subgraph of that k-tree. The approaches are empirically compared to each other and to state-of-the-art methods on a collection of public data sets with up to 100 variables.

Author Information

Siqi Nie (Facebook)
Denis Maua (University of Sao Paulo)
Cassio P de Campos (Eindhoven University of Technology)
Qiang Ji (Rensselaer Polytechnic Institute)

Related Events (a corresponding poster, oral, or spotlight)

More from the Same Authors