Approximate structure learning for large Bayesian networks

DOI10.1007/s10994-018-5701-9zbMath1473.68165OpenAlexW2802779426MaRDI QIDQ146611

Giorgio Corani, Marco Zaffalon, Cassio Polpo De Campos, Mauro Scanagatta, Cassio Polpo de Campos, Mauro Scanagatta, Giorgio Corani

Publication date: 7 May 2018

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5701-9

zbMATH Keywords

Bayesian networkstreewidthstructural learning

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Related Items (1)

r.blip

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
• Integer linear programming for the Bayesian network structure learning problem
• A Bayesian method for the induction of probabilistic networks from data
• Learning Optimal Bayesian Networks: A Shortest Path Perspective
• Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets and Complexity
• Learning Bounded Tree-Width Bayesian Networks via Sampling
• Join-Graph Propagation Algorithms
• Modeling and Reasoning with Bayesian Networks

This page was built for publication: Approximate structure learning for large Bayesian networks