The computational complexity of probabilistic inference using Bayesian belief networks
From MaRDI portal
Publication:2638807
DOI10.1016/0004-3702(90)90060-DzbMath0717.68080DBLPjournals/ai/Cooper90OpenAlexW1980452149WikidataQ56158127 ScholiaQ56158127MaRDI QIDQ2638807
Publication date: 1990
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(90)90060-d
Related Items (only showing first 100 items - show all)
FAST FACTORISATION OF PROBABILISTIC POTENTIALS AND ITS APPLICATION TO APPROXIMATE INFERENCE IN BAYESIAN NETWORKS ⋮ Continualization of Probabilistic Programs With Correction ⋮ Fundamental concepts of qualitative probabilistic networks ⋮ Quantum machine learning: a classical perspective ⋮ Graph decompositions and tree automata in reasoning with uncertainty ⋮ Lasso Granger Causal Models: Some Strategies and Their Efficiency for Gene Expression Regulatory Networks ⋮ DISTRIBUTED INFERENCE IN BAYESIAN NETWORKS ⋮ Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis ⋮ GraphBPT: An Efficient Hierarchical Data Structure for Image Representation and Probabilistic Inference ⋮ Knowledge representation and inference in similarity networks and Bayesian multinets ⋮ On the hardness of approximate reasoning ⋮ Belief networks revisited ⋮ Accelerating a continuous-time analog SAT solver using GPUs ⋮ Local conditioning in Bayesian networks ⋮ Learning cost-sensitive active classifiers ⋮ Logical perspectives on the foundations of probability ⋮ Motivating explanations in Bayesian networks using MAP-independence ⋮ Interval-based reasoning over continuous variables using independent component analysis and Bayesian networks ⋮ A Message-Passing Approach to Phase Retrieval of Sparse Signals ⋮ Unnamed Item ⋮ Incremental Junction Tree Inference ⋮ Axiomatic rationality and ecological rationality ⋮ Algorithms for convex hull finding in undirected graphical models ⋮ Inference and Learning in Multi-dimensional Bayesian Network Classifiers ⋮ Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs ⋮ Improved High Dimensional Discrete Bayesian Network Inference using Triplet Region Construction ⋮ AMP Chain Graphs: Minimal Separators and Structure Learning Algorithms ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ AN ARTIFICIAL NETWORK FOR REASONING IN THE CANCELLATION CLASS WITH APPLICATION TO THE DIAGNOSIS OF CELLS DIVISION ⋮ Solving Graph Problems via Potential Maximal Cliques ⋮ Qualitative Probability and Order of Magnitude Reasoning ⋮ Resolving Inconsistencies of Scope Interpretations in Sum-Product Networks ⋮ Updating Probabilistic Knowledge on Condition/Event Nets using Bayesian Networks ⋮ Using Four Cost Measures to Determine Arc Reversal Orderings ⋮ Importance Sampling on Bayesian Networks with Deterministic Causalities ⋮ Introduction to Bayesian Networks ⋮ A Tutorial on Learning with Bayesian Networks ⋮ The Causal Interpretation of Bayesian Networks ⋮ Adaptive Cascade ⋮ Probabilistic decision graphs for optimization under uncertainty ⋮ Optimal Dynamic Treatment Regimes ⋮ Principles and applications of continual computation ⋮ Variational Mixture of Bayesian Independent Component Analyzers ⋮ Bayesian Networks: Theory and Philosophy ⋮ Automatically finding the right probabilities in Bayesian networks ⋮ Join tree propagation with prioritized messages ⋮ Changing times: a causal theory of probabilistic temporal reasoning ⋮ Basic Principles of Learning Bayesian Logic Programs ⋮ A Bayesian Network Based Approach for Data Classification Using Structural Learning ⋮ Binary Probability Trees for Bayesian Networks Inference ⋮ IDENTIFIABILITY IN CAUSAL BAYESIAN NETWORKS: A GENTLE INTRODUCTION ⋮ Cortical Circuitry Implementing Graphical Models ⋮ Model-Based Diagnosis with Probabilistic Models ⋮ A FACTORIZED REPRESENTATION OF INDEPENDENCE OF CAUSAL INFLUENCE AND LAZY PROPAGATION ⋮ DIRECTING GENETIC ALGORITHMS FOR PROBABILISTIC REASONING THROUGH REINFORCEMENT LEARNING ⋮ Belief propagation: accurate marginals or accurate partition function—where is the difference? ⋮ Lifted Reasoning for Combinatorial Counting ⋮ Unnamed Item ⋮ Context-specific sign-propagation in qualitative probabilistic networks ⋮ The Bayesian ontology language \(\mathcal {BEL}\) ⋮ Finding MAPs for belief networks is NP-hard ⋮ Diagnosis under compound effects and multiple causes by means of the conditional causal possibility approach ⋮ A comparison of graphical techniques for decision analysis ⋮ An extended depth-first search algorithm for optimal triangulation of Bayesian networks ⋮ Efficient learning of Bayesian networks with bounded tree-width ⋮ Approximate belief updating in max-2-connected Bayes networks is NP-hard ⋮ Efficient sensitivity analysis in hidden Markov models ⋮ Mixed deterministic and probabilistic networks ⋮ Computational complexity of queries based on itemsets ⋮ Troubleshooting using probabilistic networks and value of information ⋮ Persuasive contrastive explanations for Bayesian networks ⋮ Explainable AI using MAP-independence ⋮ On cautious probabilistic inference and default detachment ⋮ The computational complexity of probabilistic inference using Bayesian belief networks ⋮ Cycle-based cluster variational method for direct and inverse inference ⋮ Naïve heuristics for paired comparisons: some results on their relative accuracy ⋮ Expressive probabilistic description logics ⋮ Understanding the role of noise in stochastic local search: analysis and experiments ⋮ Enhanced qualitative probabilistic networks for resolving trade-offs ⋮ Probabilistic reasoning in a classical logic ⋮ Importance sampling algorithms for the propagation of probabilities in belief networks ⋮ Exploiting case-based independence for approximating marginal probabilities ⋮ A modified simulation scheme for inference in Bayesian networks ⋮ Automatic emergence detection in complex systems ⋮ On the phylogeny graphs of degree-bounded digraphs ⋮ Fast algorithms for robust classification with Bayesian nets ⋮ Disjunctive interaction in continuous time Bayesian networks ⋮ Theory of influence networks ⋮ Using action-based hierarchies for real-time diagnosis ⋮ Loose-limbed people: estimating 3D human pose and motion using non-parametric belief propagation ⋮ Propagation effects of model-calculated probability values in Bayesian networks ⋮ Approximate inference in Bayesian networks using binary probability trees ⋮ Bayesian network inference using marginal trees ⋮ Networks of probabilistic events in discrete time. ⋮ Fuzzy functional dependencies and Bayesian networks ⋮ Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty. ⋮ An intercausal cancellation model for Bayesian-network engineering ⋮ An optimal approximation algorithm for Bayesian inference ⋮ Learning discrete Bayesian network parameters from continuous data streams: what is the best strategy? ⋮ Network regression with predictive clustering trees
Uses Software
Cites Work
- Fusion, propagation, and structuring in belief networks
- Probabilistic logic
- The computational complexity of probabilistic inference using Bayesian belief networks
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- A Probabilistic Causal Model for Diagnostic Problem Solving Part II: Diagnostic Strategy
- Planar Formulae and Their Uses
- Computing the Reliability of Complex Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The computational complexity of probabilistic inference using Bayesian belief networks
