Efficient learning of Bayesian networks with bounded tree-width
DOI10.1016/J.IJAR.2016.07.002zbMATH Open1401.68267OpenAlexW2470566663MaRDI QIDQ2374540FDOQ2374540
Authors: Siqi Nie, Qiang Ji, C. P. De Campos 
Publication date: 15 December 2016
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2016.07.002
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
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Bayesian network structure learning by recursive autonomy identification
- Estimating the dimension of a model
- A Bayesian method for the induction of probabilistic networks from data
- Learning Bayesian networks: The combination of knowledge and statistical data
- The max-min hill-climbing Bayesian network structure learning algorithm
- Probabilistic graphical models.
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- Title not available (Why is that?)
- Learning bounded tree-width Bayesian networks via sampling
- Modeling and Reasoning with Bayesian Networks
- Title not available (Why is that?)
- Complexity of Finding Embeddings in a k-Tree
- 10.1162/153244303321897717
- Maximum likelihood bounded tree-width Markov networks
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- The number of labeled k-dimensional trees
- Title not available (Why is that?)
- The computational complexity of probabilistic inference using Bayesian belief networks
- Bijective linear time coding and decoding for \(k\)-trees
Cited In (11)
- Learning tractable Bayesian networks in the space of elimination orders
- The necessity of bounded treewidth for efficient inference in Bayesian networks
- Learning bounded tree-width Bayesian networks via sampling
- A novel divergence for sensitivity analysis in Gaussian Bayesian networks
- Title not available (Why is that?)
- Learning Markov networks: Maximum bounded tree-width graphs
- Title not available (Why is that?)
- 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
- Efficient designs for Bayesian networks with sub-tree bounds
Uses Software
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)
