Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering

DOI10.1016/J.ARTINT.2006.09.003MaRDI QIDQ2457595zbMATH OpenOpenAlexFDO

Authors Ole J. Mengshoel, David C. Wilkins, Dan Roth

Publication date 23 October 2007

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.artint.2006.09.003

zbMATH Keywords

Bayesian networksprobabilistic reasoningrandom generation\(C/V\)-ratiocontrolled experimentsmaximal clique sizetree clustering inference

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)

Recommendations

• Understanding the scalability of Bayesian network inference using clique tree growth curves
• The computational complexity of probabilistic inference using Bayesian belief networks
• Research on parallel VE inference algorithms in Bayesian networks
• scientific article; zbMATH DE number 2014740
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing

Cites work

• scientific article; zbMATH DE number 4174342 (Why is no real title available?)
• scientific article; zbMATH DE number 4178809 (Why is no real title available?)
• scientific article; zbMATH DE number 3174791 (Why is no real title available?)
• scientific article; zbMATH DE number 67483 (Why is no real title available?)
• scientific article; zbMATH DE number 1113992 (Why is no real title available?)
• scientific article; zbMATH DE number 1149408 (Why is no real title available?)
• scientific article; zbMATH DE number 1149448 (Why is no real title available?)
• scientific article; zbMATH DE number 2014740 (Why is no real title available?)
• scientific article; zbMATH DE number 4121482 (Why is no real title available?)
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
• An algebra of bayesian belief universes for knowledge‐based systems
• Approximating MAPs for belief networks is NP-hard and other theorems
• Bucket elimination: A unifying framework for reasoning
• Complexity of Finding Embeddings in a k-Tree
• Contribution to nonserial dynamic programming
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Efficient inference in Bayes networks as a combinatorial optimization problem
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Finding MAPs for belief networks is NP-hard
• Graph minors. II. Algorithmic aspects of tree-width
• Hamilton cycles in regular 2-connected graphs
• Improved low-density parity-check codes using irregular graphs
• Inference in belief networks: A procedural guide
• Local conditioning in Bayesian networks
• Network-based heuristics for constraint-satisfaction problems
• On the hardness of approximate reasoning
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
• Probabilistic inference in multiply connected belief networks using loop cutsets
• Recursive conditioning
• Some Theorems on Abstract Graphs
• The computational complexity of probabilistic inference using Bayesian belief networks
• The distribution of loop lengths in graphical models for turbo decoding
• Topological parameters for time-space tradeoff
• Treewidth: computational experiments

Cited in

(5)

• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Understanding the role of noise in stochastic local search: analysis and experiments
• Evaluating topological ordering in directed acyclic graphs
• Understanding the scalability of Bayesian network inference using clique tree growth curves
• Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques

Describes a project that uses

Uses Software

• HUGIN

This page was built for publication: Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2457595)