Approximating probabilistic inference in Bayesian belief networks is NP- hard
From MaRDI portal
Publication:685336
Recommendations
- An optimal approximation algorithm for Bayesian inference
- The computational complexity of probabilistic inference using Bayesian belief networks
- Approximating MAPs for belief networks is NP-hard and other theorems
- The complexity of approximating MAPs for belief networks with bounded probabilities
- Approximate belief updating in max-2-connected Bayes networks is NP-hard
Cites work
- scientific article; zbMATH DE number 4176499 (Why is no real title available?)
- scientific article; zbMATH DE number 4060768 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 4189220 (Why is no real title available?)
- scientific article; zbMATH DE number 4189232 (Why is no real title available?)
- A Probabilistic Causal Model for Diagnostic Problem Solving Part I: Integrating Symbolic Causal Inference with Numeric Probabilistic Inference
- A Probabilistic Causal Model for Diagnostic Problem Solving Part II: Diagnostic Strategy
- A randomized approximation algorithm for probabilistic inference on bayesian belief networks
- Evidential reasoning using stochastic simulation of causal models
- Monte-Carlo algorithms for the planar multiterminal network reliability problem
- The computational complexity of probabilistic inference using Bayesian belief networks
Cited in
(67)- Automatically finding the right probabilities in Bayesian networks
- Improved high dimensional discrete Bayesian network inference using triplet region construction
- Iterative state-space reduction for flexible computation
- Estimating the probability of meeting a deadline in schedules and plans
- scientific article; zbMATH DE number 1983173 (Why is no real title available?)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Interval-based reasoning over continuous variables using independent component analysis and Bayesian networks
- Incremental Junction Tree Inference
- Axiomatic rationality and ecological rationality
- Gibbs sampling the posterior of neural networks
- A comparison of different marginalization operations in simple propagation
- Anytime anyspace probabilistic inference
- DISTRIBUTED INFERENCE IN BAYESIAN NETWORKS
- A compositional approach to probabilistic knowledge compilation
- Importance sampling algorithms for Bayesian networks: principles and performance
- Implicitly preserving semantics during incremental knowledge base acquisition under uncertainty.
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- On the complexity of inference about probabilistic relational models
- On the hardness of approximate reasoning
- The complexity of approximating MAPs for belief networks with bounded probabilities
- A Tutorial on Learning with Bayesian Networks
- Efficient learning of Bayesian networks with bounded tree-width
- Efficient approximation of the conditional relative entropy with applications to discriminative learning of Bayesian network classifiers
- Rational analysis, intractability, and the prospects of `as if'-explanations
- Analysing risks in supply networks to facilitate outsourcing decisions
- Dynamic importance sampling in Bayesian networks based on probability trees
- Possibilistic causality consistency problem based on asymmetrically-valued causal model
- A Monte Carlo algorithm for probabilistic propagation in belief networks based on importance sampling and stratified simulation techniques
- Approximate inference in Bayesian networks: parameterized complexity results
- Principles and applications of continual computation
- Accelerating a continuous-time analog SAT solver using GPUs
- Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
- Semantics and complexity of abduction from default theories
- Bounded recursive decomposition: A search-based method for belief-network inference under limited resources
- Learning tractable Bayesian networks in the space of elimination orders
- Hybrid algorithms for approximate belief updating in Bayes nets
- Finding MAPs for belief networks is NP-hard
- Evaluation of Bayesian networks with flexible state-space abstraction methods
- A decision support system for vine growers based on a Bayesian network
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
- Fast factorisation of probabilistic potentials and its application to approximate inference in Bayesian networks
- Adaptive cascade
- An optimal approximation algorithm for Bayesian inference
- MB-GNG: Addressing drawbacks in multi-objective optimization estimation of distribution algorithms
- A framework for building knowledge-bases under uncertainty
- Model-based diagnosis with probabilistic models
- A backward selection procedure for approximating a discrete probability distribution by decomposable models
- A scalable pairwise class interaction framework for multidimensional classification
- A modified simulation scheme for inference in Bayesian networks
- Importance sampling algorithms for the propagation of probabilities in belief networks
- Exploiting case-based independence for approximating marginal probabilities
- On the complexity of belief network synthesis and refinement
- A comparison of hybrid strategies for Gibbs sampling in mixed graphical models
- Theoretical analysis and practical insights on importance sampling in Bayesian networks
- Automatic emergence detection in complex systems
- Fuzzy functional dependencies and Bayesian networks
- Moment-based analysis of Bayesian network properties
- Troubleshooting using probabilistic networks and value of information
- Bounding probabilistic relationships in Bayesian networks using qualitative influences: methods and applications
- A note on the infeasibility of some inference processes
- Diagnosis under compound effects and multiple causes by means of the conditional causal possibility approach
- Approximating MAPs for belief networks is NP-hard and other theorems
- Local conditioning in Bayesian networks
- Importance sampling in Bayesian networks using probability trees.
- Recoverability from direct quantum correlations
- Arc refractor methods for adaptive importance sampling on large Bayesian networks under evidential reasoning
- Approximate belief updating in max-2-connected Bayes networks is NP-hard
This page was built for publication: Approximating probabilistic inference in Bayesian belief networks is NP- hard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685336)
