- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Approximating probabilistic inference in Bayesian belief networks is NP-hard
Artificial Intelligence 60 (1):141-153 (1993)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Probabilistic inference in artificial intelligence: The method of Bayesian networks.Jean-Louis Golmard - 1955 - In Anthony Eagle (ed.), Philosophy of Probability. Routledge. pp. 257--291.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
Approximate belief updating in max-2-connected Bayes networks is NP-hard.Erez Karpas, Solomon Eyal Shimony & Amos Beimel - 2009 - Artificial Intelligence 173 (12-13):1150-1153.
Overlapping communities and roles in networks with node attributes: Probabilistic graphical modeling, Bayesian formulation and variational inference.Gianni Costa & Riccardo Ortale - 2022 - Artificial Intelligence 302 (C):103580.
Probabilistic Horn abduction and Bayesian networks.David Poole - 1993 - Artificial Intelligence 64 (1):81-129.
The complexity of approximating MAPs for belief networks with bounded probabilities.Ashraf M. Abdelbar, Stephen T. Hedetniemi & Sandra M. Hedetniemi - 2000 - Artificial Intelligence 124 (2):283-288.
Probabilistic reach-avoid for Bayesian neural networks.Matthew Wicker, Luca Laurenti, Andrea Patane, Nicola Paoletti, Alessandro Abate & Marta Kwiatkowska - 2024 - Artificial Intelligence 334 (C):104132.
Analytics
Added to PP
2020-12-22
Downloads
14 (#1,272,601)
6 months
7 (#698,214)
2020-12-22
Downloads
14 (#1,272,601)
6 months
7 (#698,214)
Historical graph of downloads
Citations of this work
Good Guesses.Kevin Dorst & Matthew Mandelkern - 2021 - Philosophy and Phenomenological Research 105 (3):581-618.
A rational analysis of the selection task as optimal data selection.Mike Oaksford & Nick Chater - 1994 - Psychological Review 101 (4):608-631.
How (far) can rationality be naturalized?Gerd Gigerenzer & Thomas Sturm - 2012 - Synthese 187 (1):243-268.
Axiomatic rationality and ecological rationality.Gerd Gigerenzer - 2019 - Synthese 198 (4):3547-3564.
Rational analysis, intractability, and the prospects of ‘as if’-explanations.Iris van Rooij, Johan Kwisthout, Todd Wareham & Cory Wright - 2018 - Synthese 195 (2):491-510.
References found in this work
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Evidential reasoning using stochastic simulation of causal models.Judea Pearl - 1987 - Artificial Intelligence 32 (2):245-257.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-lv8mh dc2