scientific article; zbMATH DE number 2243356
From MaRDI portal
Publication:5715665
Bayesian problems; characterization of Bayes procedures (62C10) Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)
Recommendations
- Approximating MAPs for belief networks is NP-hard and other theorems
- The complexity of approximating MAPs for belief networks with bounded probabilities
- Most frugal explanations in Bayesian networks
- Treewidth and the Computational Complexity of MAP Approximations
- Finding MAPs for belief networks is NP-hard
Cited in
(42)- 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
- The complexity of approximating MAPs for belief networks with bounded probabilities
- Approximate belief updating in max-2-connected Bayes networks is NP-hard
- A review on evolutionary algorithms in Bayesian network learning and inference tasks
- ProCount: weighted projected model counting with graded project-join trees
- Parent Assignment Is Hard for the MDL, AIC, and NML Costs
- Stochastic decision Petri nets
- A computational-level explanation of the speed of goal inference
- On hashing-based approaches to approximate DNF-counting
- Understanding the scalability of Bayesian network inference using clique tree growth curves
- Most probable explanations in Bayesian networks: complexity and tractability
- Use of explanation trees to describe the state space of a probabilistic-based abduction problem
- MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation
- Same-decision probability: a confidence measure for threshold-based decisions
- AND/OR search for marginal MAP
- On stopping evidence gathering for diagnostic Bayesian networks
- Tree-width and the computational complexity of MAP approximations in Bayesian networks
- Relevance of evidence in Bayesian networks
- Competing hypotheses and abductive inference
- Decision analysis under ambiguity
- Explainable AI using MAP-independence
- Cost-based abduction and MAP explanation
- An evaluation of probabilistic approaches to inference to the best explanation
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
- Fast local search methods for solving limited memory influence diagrams
- Efficient learning of Bayesian networks with bounded tree-width
- The complexity of finding \(k\)th most probable explanations in probabilistic networks
- Approximate inference in Bayesian networks: parameterized complexity results
- On Imperfect Recall in Multi-Agent Influence Diagrams
- Spectral learning of weighted automata. A forward-backward perspective
- Structure approximation of most probable explanations in Bayesian networks
- Most relevant explanation: Computational complexity and approximation methods
- Motivating explanations in Bayesian networks using MAP-independence
- Mini-buckets: a general scheme for bounded inference
- Decision-theoretic optimal sampling in Hidden Markov Random Fields
- Most frugal explanations in Bayesian networks
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
- Open-world probabilistic databases: semantics, algorithms, complexity
- The Bayesian ontology language \(\mathcal {BEL}\)
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5715665)
