Efficient learning of Bayesian networks with bounded tree-width
From MaRDI portal
Publication:2374540
Recommendations
- Learning bounded tree-width Bayesian networks via sampling
- 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 tractable Bayesian networks in the space of elimination orders
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?)
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- 10.1162/153244303321897717
- A Bayesian method for the induction of probabilistic networks from data
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Bayesian network structure learning by recursive autonomy identification
- Bijective linear time coding and decoding for \(k\)-trees
- Complexity of Finding Embeddings in a k-Tree
- Estimating the dimension of a model
- Learning Bayesian networks: The combination of knowledge and statistical data
- Learning bounded tree-width Bayesian networks via sampling
- Maximum likelihood bounded tree-width Markov networks
- Modeling and Reasoning with Bayesian Networks
- Probabilistic graphical models.
- The computational complexity of probabilistic inference using Bayesian belief networks
- The max-min hill-climbing Bayesian network structure learning algorithm
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- The number of labeled k-dimensional trees
Cited in
(11)- scientific article; zbMATH DE number 5968954 (Why is no real title available?)
- Learning bounded tree-width Bayesian networks via sampling
- Learning tractable Bayesian networks in the space of elimination orders
- Approximate structure learning for large Bayesian networks
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- Learning Bayesian networks by hill climbing: efficient methods based on progressive restriction of the neighborhood
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- A novel divergence for sensitivity analysis in Gaussian Bayesian networks
- Learning Markov networks: Maximum bounded tree-width graphs
- Efficient designs for Bayesian networks with sub-tree bounds
- scientific article; zbMATH DE number 1735825 (Why is no real title available?)
This page was built for publication: Efficient learning of Bayesian networks with bounded tree-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2374540)
