Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets

DOI10.1016/j.ijar.2018.02.004zbMath1444.68161arXiv1802.02468OpenAlexW2964071773MaRDI QIDQ146614

Jaemin Yoo, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, U. Kang, U. Kang, Mauro Scanagatta, Giorgio Corani, Jaemin Yoo

Publication date: April 2018

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1802.02468

zbMATH Keywords

Bayesian networksstructural learningbounded treewidthincomplete data setsstructural EM

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22)

Related Items (5)

Bayesian network models for incomplete and dynamic data ⋮ Being Bayesian about learning Gaussian Bayesian networks from incomplete data ⋮ Approximate structure learning for large Bayesian networks ⋮ r.blip ⋮ Learning tractable Bayesian networks in the space of elimination orders

Uses Software

• missForest

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks
• Learning Bounded Tree-Width Bayesian Networks via Sampling
• Join-Graph Propagation Algorithms
• Modeling and Reasoning with Bayesian Networks
• Random forest missing data algorithms
• Bayesian Networks for Imputation

This page was built for publication: Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets