Bayesian networks

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.”

[1]  Ross D. Shachter.  Probabilistic Inference and Influence Diagrams , 1988, Oper. Res..

[2]  Paul Teller,et al.  A Characterization of Conditional Probability , 1975 .

[3]  Enrique F. Castillo,et al.  Sensitivity analysis in discrete Bayesian networks , 1997, IEEE Trans. Syst. Man Cybern. Part A.

[4]  Judea Pearl,et al.  Causal inference from indirect experiments , 1995, Artif. Intell. Medicine.

[5]  M. Frydenberg.  The chain graph Markov property , 1990 .

[6]  T. Bayes.  An essay towards solving a problem in the doctrine of chances , 2003 .

[7]  Gregory F. Cooper,et al.  A Bayesian Method for the Induction of Probabilistic Networks from Data , 1992 .

[8]  Wilfred Perks,et al.  Some observations on inverse probability including a new indifference rule , 1947 .

[9]  Steffen L. Lauritzen,et al.  Graphical models in R , 1996 .

[10]  Dan Geiger,et al.  Identifying independence in bayesian networks , 1990, Networks.

[11]  R. W. Robinson.  Counting unlabeled acyclic digraphs , 1977 .

[12]  Glenn Shafer,et al.  Probabilistic expert systems , 1996, CBMS-NSF regional conference series in applied mathematics.

[13]  Peter C. Cheeseman,et al.  An inquiry into computer understanding , 1988, Comput. Intell..

[14]  David Heckerman,et al.  A Tractable Inference Algorithm for Diagnosing Multiple Diseases , 2013, UAI.

[15]  Stephen M. Stigler,et al.  Who Discovered Bayes's Theorem? , 1983 .

[16]  Judea Pearl,et al.  Fusion, Propagation, and Structuring in Belief Networks , 1986, Artif. Intell..

[17]  P. Spirtes,et al.  Causation, prediction, and search , 1993 .

[18]  D. Lewis.  A Subjectivist’s Guide to Objective Chance , 1980 .

[19]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[20]  Gregory F. Cooper,et al.  A combination of exact algorithms for inference on Bayesian belief networks , 1991, Int. J. Approx. Reason..

[21]  Judea Pearl,et al.  An Algorithm for Deciding if a Set of Observed Independencies Has a Causal Explanation , 1992, UAI.

[22]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[23]  A. P. Dawid,et al.  Applications of a general propagation algorithm for probabilistic expert systems , 1992 .

[24]  W. Deming,et al.  On a Least Squares Adjustment of a Sampled Frequency Table When the Expected Marginal Totals are Known , 1940 .

[25]  Dan Geiger,et al.  Conditional independence and its representations , 1990, Kybernetika.

[26]  Michael Luby,et al.  Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..

[27]  C. Glymour,et al.  Conditioning and Intervening , 1994, The British Journal for the Philosophy of Science.

[28]  David T. Brown,et al.  A Note on Approximations to Discrete Probability Distributions , 1959, Inf. Control..

[29]  Judea Pearl,et al.  Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach , 1982, AAAI.

[30]  I. J. Good,et al.  Causal Tendency, Necessitivity and Sufficientivity: An Updated Review , 1994 .

[31]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[32]  Donald Gillies,et al.  Was Bayes a Bayesian , 1987 .

[33]  Edward C. Molina,et al.  Bayes' Theorem: An Expository Presentation , 1931 .

[34]  S. Lauritzen.  Propagation of Probabilities, Means, and Variances in Mixed Graphical Association Models , 1992 .

[35]  Ross D. Shachter,et al.  Directed reduction algorithms and decomposable graphs , 1990, UAI.

[36]  B. D. Finetti.  La prévision : ses lois logiques, ses sources subjectives , 1937 .

[37]  D. Madigan,et al.  Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs , 1996 .

[38]  Stephen M. Stigler,et al.  Thomas Bayes's Bayesian Inference , 1982 .

[39]  P. Diaconis,et al.  Updating Subjective Probability , 1982 .

[40]  R. H. Strotz,et al.  RECURSIVE VS. NONRECURSIVE SYSTEMS: AN ATTEMPT AT SYNTHESIS (PART I OF A TRIPTYCH ON CAUSAL CHAIN SYSTEMS) , 1960 .

[41]  D. Geiger,et al.  A characterization of the Dirichlet distribution through global and local parameter independence , 1997 .

[42]  J. Dickey.  Multiple Hypergeometric Functions: Probabilistic Interpretations and Statistical Uses , 1983 .

[43]  Illtyd Trethowan.  Causality , 1938 .

[44]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

[45]  Judea Pearl,et al.  Evidential Reasoning Using Stochastic Simulation of Causal Models , 1987, Artif. Intell..

[46]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[47]  Stefan Arnborg,et al.  Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey , 1985, BIT.

[48]  Stefan Arnborg,et al.  Graph decompositions and tree automata in reasoning with uncertainty , 1993, J. Exp. Theor. Artif. Intell..

[49]  Radford M. Neal.  Connectionist Learning of Belief Networks , 1992, Artif. Intell..

[50]  L. M. M.-T..  Theory of Probability , 1929, Nature.

[51]  D. Edwards.  Introduction to graphical modelling , 1995 .

[52]  E. Fowlkes,et al.  Evaluating Logistic Models for Large Contingency Tables , 1988 .

[53]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[54]  Frank Jensen,et al.  Approximations in Bayesian Belief Universe for Knowledge Based Systems , 2013, UAI 1990.

[55]  P. Suppes.  A Probabilistic Theory Of Causality , 1970 .

[56]  Petr Hájek,et al.  Uncertain information processing in expert systems , 1992 .

[57]  J. Pearl.  Causal diagrams for empirical research , 1995 .

[58]  P. Games.  Correlation and Causation: A Logical Snafu , 1990 .

[59]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[60]  Enrique F. Castillo,et al.  A new method for efficient symbolic propagation in discrete Bayesian networks , 1996, Networks.

[61]  T. Speed,et al.  Recursive causal models , 1984, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[62]  Bruce D'Ambrosio,et al.  Local Expression Languages for Probabilistic Dependence: a Preliminary Report , 1994, UAI 1994.

[63]  Judea Pearl,et al.  The Logic of Representing Dependencies by Directed Graphs , 1987, AAAI.

[64]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[65]  Alice M. Agogino,et al.  Real-Time Expert System for Fault-Tolerant Supervisory Control , 1993 .

[66]  A. Dawid.  Conditional Independence , 1997 .

[67]  Karl Pearson,et al.  THE FUNDAMENTAL PROBLEM OF PRACTICAL STATISTICS , 1920 .

[68]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[69]  Peter C. Cheeseman,et al.  In defense of An inquiry into computer understanding , 1988, Comput. Intell..