Bayesian networks
- 1 March 1995
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 38 (3) , 27-30
- https://doi.org/10.1145/203330.203336
Abstract
This brief tutorial on Bayesian networks serves to introduce readers to some of the concepts, terminology, and notation employed by articles in this special section. In a Bayesian network, a variable takes on values from a collection of mutually exclusive and collective exhaustive states. A variable may be discrete, having a finite or countable number of states, or it may be continuous. Often the choice of states itself presents an interesting modeling question. For example, in a system for troubleshooting a problem with printing, we may choose to model the variable “print output” with two states—“present” and “absent”—or we may want to model the variable with finer distinctions such as “absent,” “blurred ,” “cut off,” and “ok.”Keywords
This publication has 6 references indexed in Scilit:
- Approximating probabilistic inference in Bayesian belief networks is NP-hardArtificial Intelligence, 1993
- A combination of exact algorithms for inference on Bayesian belief networksInternational Journal of Approximate Reasoning, 1991
- The computational complexity of probabilistic inference using bayesian belief networksArtificial Intelligence, 1990
- Probabilistic Inference and Influence DiagramsOperations Research, 1988
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988
- Fusion, propagation, and structuring in belief networksArtificial Intelligence, 1986