A microscopic study of minimum entropy search in learning decomposable Markov networks
From MaRDI portal
(Redirected from Publication:677528)
A ''microscopic'' study of minimum entropy search in learning decomposable Markov networks
A ''microscopic'' study of minimum entropy search in learning decomposable Markov networks
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
- Discovering a junction tree behind a Markov network by a greedy algorithm
- Complexity measurement of fundamental pseudo-independent models
- Corrected score methods for estimating Bayesian networks with error-prone nodes
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- Learning decomposable Markov networks in pseudo-independent domains with local evaluation
- The minimum-entropy set cover problem
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)
