Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables

Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon

Neural Information Processing Systems 

Parviainen et al. (2014) adopted an anytime integer linear programming (ILP) Otherwise it returns a sub-optimal DAG with bounded treewidth. Nie et al. (2014) proposed an efficient anytime ILP approach with a polynomial number of constraints Nie et al. (2015) proposed the method S2.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found