On pruning with the MDL score

DOI10.1016/J.IJAR.2017.10.023MaRDI QIDQ1687302zbMATH OpenOpenAlexFDO

Authors Eunice Yuh-Jie Chen, Adnan Darwiche, Arthur Choi

Publication date 22 December 2017

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

Full work available at URL https://doi.org/10.1016/j.ijar.2017.10.023

zbMATH Keywords

Bayesian networksstructure learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Entropy-based pruning for learning Bayesian networks using BIC
• Efficient structure learning of Bayesian networks using constraints
• An efficient Bayesian network structure learning strategy
• Min-BDeu and max-BDeu scores for learning Bayesian networks
• scientific article; zbMATH DE number 5183798

Cites work

• A Bayesian method for the induction of probabilistic networks from data
• Efficient structure learning of Bayesian networks using constraints
• Exact Bayesian structure discovery in Bayesian networks
• Learning optimal Bayesian networks: a shortest path perspective
• Machine learning. A probabilistic perspective
• Modeling and Reasoning with Bayesian Networks
• Probabilistic graphical models.

Cited in

(1)

• Entropy-based pruning for learning Bayesian networks using BIC

Describes a project that uses

Uses Software

• UCI
• PMTK

This page was built for publication: On pruning with the MDL score

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