Approximation methods for efficient learning of Bayesian networks.

MaRDI QIDQ5447504zbMATH OpenFDO

Authors Carsten Riggelsen

Publication date 7 March 2008

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Bayesian inference (62F15) Monte Carlo methods (65C05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Learning Bayesian networks: The combination of knowledge and statistical data
• scientific article; zbMATH DE number 1222289
• A maximum entropy approach to learn Bayesian networks from incomplete data
• Construction and learning methods of Bayesian networks
• Modeling and Reasoning with Bayesian Networks

Cited in

(8)

• Efficient inference in Bayes networks as a combinatorial optimization problem
• Efficient approximations for the marginal likelihood of Bayesian networks with hidden variables
• Polyhedral approaches to learning Bayesian networks
• An Efficient Algorithm for Learning Bayesian Networks from Data
• scientific article; zbMATH DE number 5926256 (Why is no real title available?)
• scientific article; zbMATH DE number 5183798 (Why is no real title available?)
• Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
• A maximum entropy approach to learn Bayesian networks from incomplete data

This page was built for publication: Approximation methods for efficient learning of Bayesian networks.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447504)