- 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
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
Artificial Intelligence 170 (16-17):1137-1174 (2006)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Understanding the scalability of Bayesian network inference using clique tree growth curves.Ole J. Mengshoel - 2010 - Artificial Intelligence 174 (12-13):984-1006.
Social networks, support cliques, and kinship.R. I. M. Dunbar & M. Spoors - 1995 - Human Nature 6 (3):273-290.
A model-theoretic characterisation of clique width.Achim Blumensath - 2006 - Annals of Pure and Applied Logic 142 (1):321-350.
Tree clustering for constraint networks.Rina Dechter & Judea Pearl - 1989 - Artificial Intelligence 38 (3):353-366.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
Is human conversation more efficient than chimpanzee grooming?Michio Nakamura - 2000 - Human Nature 11 (3):281-297.
Analyzing the Simonshaven Case Using Bayesian Networks.Norman Fenton, Martin Neil, Barbaros Yet & David Lagnado - 2020 - Topics in Cognitive Science 12 (4):1092-1114.
The easy problems ain't so easy.David Hodgson - 1996 - Journal of Consciousness Studies 3 (1):69-75.
A special class of almost disjoint families.Thomas E. Leathrum - 1995 - Journal of Symbolic Logic 60 (3):879-891.
Foundations for Bayesian networks.Jon Williamson - 2001 - In David Corfield & Jon Williamson (eds.), Foundations of Bayesianism. Kluwer Academic Publishers. pp. 75--115.
Analytics
Added to PP
2020-12-22
Downloads
5 (#1,505,296)
6 months
4 (#818,853)
2020-12-22
Downloads
5 (#1,505,296)
6 months
4 (#818,853)
Historical graph of downloads
Citations of this work
Understanding the role of noise in stochastic local search: Analysis and experiments.Ole J. Mengshoel - 2008 - Artificial Intelligence 172 (8-9):955-990.
Understanding the scalability of Bayesian network inference using clique tree growth curves.Ole J. Mengshoel - 2010 - Artificial Intelligence 174 (12-13):984-1006.
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.
Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
Probabilistic models of language processing and acquisition.Nick Chater & Christopher D. Manning - 2006 - Trends in Cognitive Sciences 10 (7):335–344.
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
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-7c76586df8-hc2g5 uwo