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

DOI10.1016/J.ARTINT.2006.09.003zbMATH Open1130.68096OpenAlexW2156243160MaRDI QIDQ2457595FDOQ2457595

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

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

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)

Cites Work

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

Cited In (5)

• 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
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks

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)