A microscopic study of minimum entropy search in learning decomposable Markov networks

DOI10.1023/A:1007324100110MaRDI QIDQ677528zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 4 August 1997

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1007324100110

zbMATH Keywords

probabilistic networks

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning decomposable Markov networks in pseudo-independent domains with local evaluation
• Learning Bayesian networks: The combination of knowledge and statistical data
• Entropy-based pruning for learning Bayesian networks using BIC
• Learning the Structure of a Bayesian Network: An Application of Information Geometry and the Minimum Description Length Principle

Cited in

(7)

• Towards using the chordal graph polytope in learning decomposable models
• Complexity measurement of fundamental pseudo-independent models
• The minimum-entropy set cover problem
• Discovering a junction tree behind a Markov network by a greedy algorithm
• A backward selection procedure for approximating a discrete probability distribution by decomposable models
• Corrected score methods for estimating Bayesian networks with error-prone nodes
• Learning decomposable Markov networks in pseudo-independent domains with local evaluation

This page was built for publication: A microscopic study of minimum entropy search in learning decomposable Markov networks

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