paper-with-me

Papers

Learning Bounded Treewidth Bayesian Networks with Thousands of Variables

2016-05-11 · Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon

We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian greatly reduces the complexity of inferences. Yet, being a global property of the graph, it considerably increases the difficulty of the learning process. We propose a novel algorithm for this task, able to scale to large domains and large treewidths. Our novel approach consistently outperforms the state of the art on data sets with up to ten thousand variables.

📄 PDF Abstract BibTeX arXiv:1605.03392

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables

2016-12-01 · NeurIPS 2016 12 · Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon

We present a method for learning treewidth-bounded Bayesian networks from data sets containing thousands of variables. Bounding the treewidth of a Bayesian network greatly reduces the complexity of inferences. Yet, bein…

Turbocharging Treewidth-Bounded Bayesian Network Structure Learning

2020-06-24 · Vaidyanathan P. R., Stefan Szeider

We present a new approach for learning the structure of a treewidth-bounded Bayesian Network (BN). The key to our approach is applying an exact method (based on MaxSAT) locally, to improve the score of a heuristically co…

Advances in Learning Bayesian Networks of Bounded Treewidth

2014-06-05 · NeurIPS 2014 12 · Siqi Nie, Denis Deratani Maua, Cassio Polpo de Campos, Qiang Ji

This work presents novel algorithms for learning Bayesian network structures with bounded treewidth. Both exact and approximate methods are developed. The exact method combines mixed-integer linear programming formulatio…

Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets

2018-02-07 · Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo 외

Learning a Bayesian networks with bounded treewidth is important for reducing the complexity of the inferences. We present a novel anytime algorithm (k-MAX) method for this task, which scales up to thousands of variables…

Imputation

Learning Bounded Treewidth Bayesian Networks

2008-12-01 · NeurIPS 2008 12 · Gal Elidan, Stephen Gould

With the increased availability of data for complex domains, it is desirable to learn Bayesian network structures that are sufficiently expressive for generalization while also allowing for tractable inference. While the…