Learning bounded tree-width Bayesian networks via sampling
From MaRDI portal
Recommendations
- Efficient learning of Bayesian networks with bounded tree-width
- scientific article; zbMATH DE number 5968954
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- Approximate structure learning for large Bayesian networks
- Learning Markov networks: Maximum bounded tree-width graphs
Cites work
- scientific article; zbMATH DE number 5968954 (Why is no real title available?)
- scientific article; zbMATH DE number 4103086 (Why is no real title available?)
- A Bayesian method for the induction of probabilistic networks from data
- Bijective linear time coding and decoding for \(k\)-trees
- Complexity of Finding Embeddings in a k-Tree
- Efficient structure learning of Bayesian networks using constraints
- Estimating the dimension of a model
- Learning Bayesian networks: The combination of knowledge and statistical data
- The necessity of bounded treewidth for efficient inference in Bayesian networks
Cited in
(11)- Learning tractable Bayesian networks in the space of elimination orders
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- scientific article; zbMATH DE number 5547867 (Why is no real title available?)
- Optimization problems for machine learning: a survey
- Maximum likelihood bounded tree-width Markov networks
- Efficient learning of Bayesian networks with bounded tree-width
- Learning Markov networks: Maximum bounded tree-width graphs
- Approximate structure learning for large Bayesian networks
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- scientific article; zbMATH DE number 5968954 (Why is no real title available?)
- Efficient designs for Bayesian networks with sub-tree bounds
This page was built for publication: Learning bounded tree-width Bayesian networks via sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3451198)
