Most probable explanations in Bayesian networks: complexity and tractability
From MaRDI portal
Recommendations
- Tractability of most probable explanations in multidimensional Bayesian network classifiers
- Structure approximation of most probable explanations in Bayesian networks
- Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
- The complexity of finding \(k\)th most probable explanations in probabilistic networks
- Most frugal explanations in Bayesian networks
- Most relevant explanation in Bayesian networks
- SIMPLIFYING EXPLANATIONS IN BAYESIAN BELIEF NETWORKS
- Using Complexity for the Estimation of Bayesian Networks
Cites work
- scientific article; zbMATH DE number 1699992 (Why is no real title available?)
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1216123 (Why is no real title available?)
- scientific article; zbMATH DE number 1354123 (Why is no real title available?)
- scientific article; zbMATH DE number 1161563 (Why is no real title available?)
- scientific article; zbMATH DE number 809154 (Why is no real title available?)
- scientific article; zbMATH DE number 2243356 (Why is no real title available?)
- Approximating MAPs for belief networks is NP-hard and other theorems
- Bayesian Networks and Decision Graphs
- Computational Complexity of Probabilistic Turing Machines
- Cost-based abduction and MAP explanation
- Financial analysis using Bayesian networks
- Finding MAPs for belief networks is NP-hard
- Graph minors. II. Algorithmic aspects of tree-width
- Inference and Learning in Multi-dimensional Bayesian Network Classifiers
- Knowledge in flux. Modeling the dynamics of epistemic states
- Multi-dimensional classification with Bayesian networks
- PP is as Hard as the Polynomial-Time Hierarchy
- Parametrized complexity theory.
- Probabilistic graphical models.
- Simple characterizations of \(P(\# P)\) and complete problems
- Stochastic Boolean satisfiability
- The Computational Complexity of Monotonicity in Probabilistic Networks
- The complexity of combinatorial problems with succinct input representation
- The complexity of finding \(k\)th most probable explanations in probabilistic networks
- The complexity of optimization problems
- The complexity of theorem-proving procedures
Cited in
(24)- Most frugal explanations in Bayesian networks
- Energy distribution view for monotonic dual decomposition
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
- Rational analysis, intractability, and the prospects of `as if'-explanations
- MPE Computation in Bayesian Networks Using Mini-Bucket and Probability Trees Approximation
- Approximate inference in Bayesian networks: parameterized complexity results
- Learning tractable Bayesian networks in the space of elimination orders
- Competing hypotheses and abductive inference
- Structure approximation of most probable explanations in Bayesian networks
- The Computational Complexity of Monotonicity in Probabilistic Networks
- Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
- Thirty years of credal networks: specification, algorithms and complexity
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams
- Tractability of most probable explanations in multidimensional Bayesian network classifiers
- A computational-level explanation of the speed of goal inference
- Most Inforbable Explanations: Finding Explanations in Bayesian Networks That Are Both Probable and Informative
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- An evaluation of probabilistic approaches to inference to the best explanation
- MPE inference in conditional linear Gaussian networks
- Motivating explanations in Bayesian networks using MAP-independence
- Explainable AI using MAP-independence
- The complexity of finding \(k\)th most probable explanations in probabilistic networks
This page was built for publication: Most probable explanations in Bayesian networks: complexity and tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433524)
