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

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Artificial Intelligence

• Publication date

  2006-11-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.artint.2006.09.003
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Artificial Intelligence in Medicine: 23rd International Conference, AIME 2025, Pavia, Italy, June 23–26, 2025, Proceedings, Part I

  2025cited by this paper
• Conditioning Methods for Exact and Approximate Inference in Causal Networks

  2013cited by this paper
• Bounded Conditioning: Flexible Inference for Decisions under Scarce Resources

  2013cited by this paper
• Probabilistic models of language processing and acquisition.

  2006cited by this paper
• Bayesian Networks in Reliability: Some Recent Developments

  2004cited by this paper
• Information Theory, Inference, and Learning Algorithms

  2004influential reference
• Low-Density Parity-Check Codes

  2004influential reference
• Generating Random Bayesian Networks with Constraints on Induced Width

  2004influential reference
• Information filtering using bayesian networks: effective user interfaces for aviation weather data

  2003cited by this paper
• Raven: Bayesian Networks for Human-Computer Intelligent Interaction

  2002cited by this paper
• Random Generation of Bayesian Networks

  2002cited by this paper
• Approximating MAP using Local Search

  2001influential reference
• Improved low-density parity-check codes using irregular graphs

  2001cited by this paper
• Treewidth: Computational Experiments

  2001influential reference
• Improving the analysis of dependable systems by mapping fault trees into Bayesian networks

  2001cited by this paper
• Recursive conditioning

  2001influential reference
• Explaining away ambiguity: Learning verb selectional preference with Bayesian networks

  2000cited by this paper
• Hard and Easy Bayesian Networks for Computing the Most Probable Explanation

  2000cited by this paper
• Stochastic Greedy Search: Efficiently Computing a Most Probable Explanation in Bayesian Networks

  2000cited by this paper
• Stochastic local search for Bayesian network

  1999influential reference
• Blocking Gibbs sampling for linkage analysis in large pedigrees with many loops.

  1999influential reference
• Bucket Elimination: A Unifying Framework for Reasoning

  1999cited by this paper
• The distribution of loop lengths in graphical models for turbo decoding

  1999cited by this paper
• Efficient Bayesian Network Inference: Genetic Algorithms, Stochastic Local Search, and Abstraction

  1999influential reference
• Approximating MAPs for Belief Networks is NP-Hard and Other Theorems

  1998influential reference
• CoRAVEN: modeling and design of a multimedia intelligent infrastructure for collaborative intelligence analysis

  1998cited by this paper
• Graphical Models for Machine Learning and Digital Communication

  1998influential reference
• Improved low-density parity-check codes using irregular graphs and belief propagation

  1998influential reference
• When Gravity Fails: Local Search Topology

  1997influential reference
• Satisfiability Problem: Theory and Applications

  1997cited by this paper
• Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs

  1997influential reference
• Real Time Estimation of Bayesian Networks

  1996cited by this paper
• Topological parameters for time-space tradeoff

  1996influential reference
• Local Search and the Number of Solutions

  1996influential reference
• Exploiting Causal Independence in Bayesian Network Inference

  1996cited by this paper
• Local Conditioning in Bayesian Networks

  1996cited by this paper
• Inference in belief networks: A procedural guide

  1996cited by this paper
• Algorithms for the satisfiability (SAT) problem: A survey

  1996cited by this paper
• Graph Minors: XV. Giant Steps

  1996cited by this paper
• Conditioning Algorithms for Exact and Approximate Inference in Causal Networks

  1995cited by this paper
• A compendium of NP optimization problems

  1994cited by this paper
• Finding MAPs for Belief Networks is NP-Hard

  1994cited by this paper
• Approximation Algorithms for the Loop Cutset Problem

  1994cited by this paper
• Global Conditioning for Probabilistic Inference in Belief Networks

  1994cited by this paper
• Efficient inference in Bayes networks as a combinatorial optimization problem

  1994cited by this paper
• Noise Strategies for Improving Local Search

  1994cited by this paper
• Inductive and Bayesian learning in medical diagnosis

  1993cited by this paper
• On the Hardness of Approximate Reasoning

  1993cited by this paper
• Applications of a general propagation algorithm for probabilistic expert systems

  1992cited by this paper
• Optimal decomposition of probabilistic networks by simulated annealing

  1992cited by this paper
• Hard and Easy Distributions of SAT Problems

  1992influential reference
• A New Method for Solving Hard Satis ability Problems

  1992cited by this paper
• Search-Based Methods to Bound Diagnostic Probabilities in Very Large Belief Nets

  1991cited by this paper
• Probabilistic reasoning in intelligent systems: Networks of plausible inference

  1991influential reference
• Where the Really Hard Problems Are

  1991cited by this paper
• Probabilistic Diagnosis Using a Reformulation of the INTERNIST-1/QMR Knowledge Base

  1991influential reference
• Probabilistic inference in multiply connected belief networks using loop cutsets

  1990cited by this paper
• An algebra of bayesian belief universes for knowledge-based systems

  1990influential reference
• Uncertainty in Artificial Intelligence 5

  1990cited by this paper
• Bayesian updating in causal probabilistic networks by local computations

  1990cited by this paper
• Local computations with probabilities on graphical structures and their application to expert systems

  1990cited by this paper
• The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks

  1990cited by this paper
• HUGIN - A Shell for Building Bayesian Belief Universes for Expert Systems

  1989cited by this paper
• A valuation-based language for expert systems

  1989cited by this paper
• Complexity of finding embeddings in a k -tree

  1987influential reference
• MUNIN - A Causal Probabilistic Network for Interpretation of Electromyographic Findings

  1987cited by this paper
• Information Theory

  1987influential reference
• Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

  1987cited by this paper
• Network-Based Heuristics for Constraint-Satisfaction Problems

  1987influential reference
• Graph Minors. II. Algorithmic Aspects of Tree-Width

  1986cited by this paper
• A Constraint-Propagation Approach to Probabilistic Reasoning

  1985cited by this paper
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey

  1985influential reference
• Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

  1983cited by this paper
• Hamilton cycles in regular 2-connected graphs

  1980cited by this paper
• Fast probabilistic algorithms for hamiltonian circuits and matchings

  1977cited by this paper
• Nonserial Dynamic Programming

  1972influential reference
• Information Theory

  1966cited by this paper
• Some Theorems on Abstract Graphs

  1952cited by this paper

• Automated rock joint trace mapping using a supervised learning model trained on synthetic data generated by parametric modelling

  2026cites this paper
• Evaluating topological ordering in directed acyclic graphs

  2021cites this paper
• On the step size selection in variance-reduced algorithm for nonconvex optimization

  2020cites this paper
• Renewable Energy Integration: Bayesian Networks for Probabilistic State Estimation

  2018cites this paper
• Data Analytics for Renewable Energy Integration. Technologies, Systems and Society

  2018cites this paper
• Inference of time-delayed gene regulatory networks based on dynamic Bayesian network hybrid learning method

  2017cites this paper
• Conditional probability generation methods for high reliability effects-based decision making

  2015cites this paper
• Threshold functions in random s-intersection graphs

  2015cites this paper
• Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

  2011influential citation
• Visualizing and Understanding Large-Scale Bayesian Networks

  2011cites this paper
• Study of Intellectualized Fluorescence Spectrometer with Optical Fiber

  2010cites this paper
• Understanding the scalability of Bayesian network inference using clique tree growth curves

  2010influential citation
• Removing spikes while preserving data and noise using wavelet filter banks

  2010cites this paper
• Extracting Decision Trees from Diagnostic Bayesian Networks to Guide Test Selection

  2010cites this paper
• Methods for Probabilistic Fault Diagnosis: An Electrical Power System Case Study

  2009cites this paper
• Estratégia de otimização para a melhoria da interpretabilidade de redes bayesianas: aplicações em sistemas elétricos de potência

  2009cites this paper
• Constraint Handling Using Tournament Selection: Abductive Inference in Partly Deterministic Bayesian Networks

  2009influential citation
• Random graph models for directed acyclic networks.

  2009cites this paper
• Developing Large-Scale Bayesian Networks by Composition: Fault Diagnosis of Electrical Power Systems in Aircraft and Spacecraft

  2009cites this paper
• Sensor Validation using Bayesian Networks

  2008cites this paper
• Understanding the role of noise in stochastic local search: Analysis and experiments

  2008cites this paper
• Diagnosing Faults in Electrical Power Systems of Spacecraft and Aircraft

  2008cites this paper
• Macroscopic Models of Clique Tree Growth for Bayesian Networks

  2007cites this paper
• Designing Resource-Bounded Reasoners using Bayesian Networks: System Health Monitoring and Diagnosis

  2007influential citation
• Mendelian Error Detection in Complex Pedigrees Using Weighted Constraint Satisfaction Techniques

  2007influential citation
• Advanced Diagnostics and Prognostics Testbed

  2007cites this paper
• Evaluation, Selection, and Application of Model-Based Diagnosis Tools and Approaches

  2007cites this paper
• 2 F eb 2 01 5 Threshold Functions in Random s-Intersection Graphs

  year unknowncites this paper
• > Replace This Line with Your Paper Identification Number (double-click Here to Edit) <

  year unknowncites this paper