scientific article; zbMATH DE number 2243356
From MaRDI portal
Publication:5715665
zbMath1080.68689arXiv1107.0024MaRDI QIDQ5715665
Publication date: 4 January 2006
Full work available at URL: https://arxiv.org/abs/1107.0024
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Bayesian problems; characterization of Bayes procedures (62C10) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (29)
The Bayesian ontology language \(\mathcal {BEL}\) ⋮ Efficient learning of Bayesian networks with bounded tree-width ⋮ Relevance of Evidence in Bayesian Networks ⋮ Same-decision probability: a confidence measure for threshold-based decisions ⋮ Explainable AI using MAP-independence ⋮ Decision analysis under ambiguity ⋮ Understanding the role of noise in stochastic local search: analysis and experiments ⋮ Motivating explanations in Bayesian networks using MAP-independence ⋮ 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 ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ On Imperfect Recall in Multi-Agent Influence Diagrams ⋮ Most probable explanations in Bayesian networks: complexity and tractability ⋮ A computational-level explanation of the speed of goal inference ⋮ A review on evolutionary algorithms in Bayesian network learning and inference tasks ⋮ An evaluation of probabilistic approaches to inference to the best explanation ⋮ Approximate inference in Bayesian networks: parameterized complexity results ⋮ Spectral learning of weighted automata. A forward-backward perspective ⋮ Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ On Stopping Evidence Gathering for Diagnostic Bayesian Networks ⋮ Use of Explanation Trees to Describe the State Space of a Probabilistic-Based Abduction Problem ⋮ Understanding the scalability of Bayesian network inference using clique tree growth curves ⋮ Competing hypotheses and abductive inference ⋮ Most frugal explanations in Bayesian networks ⋮ The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks ⋮ Most relevant explanation: Computational complexity and approximation methods ⋮ Unnamed Item ⋮ ProCount: weighted projected model counting with graded project-join trees
This page was built for publication:
