Learning tractable Bayesian networks in the space of elimination orders
From MaRDI portal
Publication:2321308
Recommendations
- Efficient learning of Bayesian networks with bounded tree-width
- Tractability of most probable explanations in multidimensional Bayesian network classifiers
- scientific article; zbMATH DE number 5968954
- Efficient structure learning of Bayesian networks using constraints
- Learning bounded tree-width Bayesian networks via sampling
Cites work
- scientific article; zbMATH DE number 4178809 (Why is no real title available?)
- scientific article; zbMATH DE number 3624650 (Why is no real title available?)
- scientific article; zbMATH DE number 4189233 (Why is no real title available?)
- A Bayesian method for the induction of probabilistic networks from data
- A differential approach to inference in Bayesian networks
- A linear time algorithm for finding tree-decompositions of small treewidth
- A new look at the statistical model identification
- Algorithmic Aspects of Vertex Elimination on Graphs
- An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
- Approximating probabilistic inference in Bayesian belief networks is NP- hard
- Automata, Languages and Programming
- Complexity of Finding Embeddings in a k-Tree
- Discrete Bayesian network classifiers: a survey
- Efficient learning of Bayesian networks with bounded tree-width
- Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
- Estimating the dimension of a model
- Heuristic and metaheuristic methods for computing graph treewidth
- Learning Bayesian networks: The combination of knowledge and statistical data
- Learning Markov networks: Maximum bounded tree-width graphs
- Maximum cardinality search for computing minimal triangulations of graphs
- Methods for constructing balanced elimination trees and other recursive decompositions
- Modeling and Reasoning with Bayesian Networks
- Modified Sequentially Rejective Multiple Test Procedures
- Most probable explanations in Bayesian networks: complexity and tractability
- Multi-dimensional classification with Bayesian networks
- Network flows. Theory, algorithms, and applications.
- On Exact Algorithms for Treewidth
- Probabilistic graphical models.
- Recursive conditioning
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Statistical comparisons of classifiers over multiple data sets
- The computational complexity of probabilistic inference using Bayesian belief networks
- The elimination form of the inverse and its application to linear programming
- Tractability of most probable explanations in multidimensional Bayesian network classifiers
- Treewidth computation and extremal combinatorics
- Treewidth computations. I: Upper bounds
- Unsupervised training of Bayesian networks for data clustering
Cited in
(3)
This page was built for publication: Learning tractable Bayesian networks in the space of elimination orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321308)
