Learning tractable Bayesian networks in the space of elimination orders

DOI10.1016/J.ARTINT.2018.11.007zbMATH Open1478.68280OpenAlexW2913347837MaRDI QIDQ2321308FDOQ2321308

Authors: Marco Benjumeda, Concha Bielza, Pedro Larrañaga 

Publication date: 28 August 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://oa.upm.es/63607/

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

zbMATH Keywords

machine learningBayesian networksinference complexitylearning tractable modelstreewidth estimation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Probabilistic graphical models (62H22) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Estimating the dimension of a model
• A new look at the statistical model identification
• Statistical comparisons of classifiers over multiple data sets
• An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
• Title not available (Why is that?)
• A Bayesian method for the induction of probabilistic networks from data
• Learning Bayesian networks: The combination of knowledge and statistical data
• Treewidth computation and extremal combinatorics
• Probabilistic graphical models.
• A differential approach to inference in Bayesian networks
• Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets
• Modeling and Reasoning with Bayesian Networks
• Multi-dimensional classification with Bayesian networks
• Complexity of Finding Embeddings in a k-Tree
• On Exact Algorithms for Treewidth
• A linear time algorithm for finding tree-decompositions of small treewidth
• Learning Markov networks: Maximum bounded tree-width graphs
• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Discrete Bayesian network classifiers: a survey
• Treewidth computations. I: Upper bounds
• Modified Sequentially Rejective Multiple Test Procedures
• The computational complexity of probabilistic inference using Bayesian belief networks
• The elimination form of the inverse and its application to linear programming
• Recursive conditioning
• Maximum cardinality search for computing minimal triangulations of graphs
• Efficient learning of Bayesian networks with bounded tree-width
• Title not available (Why is that?)
• Tractability of most probable explanations in multidimensional Bayesian network classifiers
• Most probable explanations in Bayesian networks: complexity and tractability
• Automata, Languages and Programming
• Heuristic and metaheuristic methods for computing graph treewidth
• Methods for constructing balanced elimination trees and other recursive decompositions
• Title not available (Why is that?)
• Unsupervised training of Bayesian networks for data clustering

Cited In (3)

• Efficient learning of Bayesian networks with bounded tree-width
• Learning Bayesian network parameters under order constraints
• Improved high dimensional discrete Bayesian network inference using triplet region construction

Uses Software

• ComputeTW

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)