Fusion, Propagation, and Structuring in Belief Networks

Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to represent the generic knowledge of a domain expert, and it turns into a computational architecture if the links are used not merely for storing factual knowledge but also for directing and activating the data flow in the computations which manipulate this knowledge. The first part of the paper deals with the task of fusing and propagating the impacts of new information through the networks in such a way that, when equilibrium is reached, each proposition will be assigned a measure of belief consistent with the axioms of probability theory. It is shown that if the network is singly connected (e.g. tree-structured), then probabilities can be updated by local propagation in an isomorphic network of parallel and autonomous processors and that the impact of new information can be imparted to all propositions in time proportional to the longest path in the network. The second part of the paper deals with the problem of finding a tree-structured representation for a collection of probabilistically coupled propositions using auxiliary (dummy) variables, colloquially called "hidden causes." It is shown that if such a tree-structured representation exists, then it is possible to uniquely uncover the topology of the tree by observing pairwise dependencies among the available propositions (i.e., the leaves of the tree). The entire tree structure, including the strengths of all internal relationships, can be reconstructed in time proportional to n log n, where n is the number of leaves.

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

[2]  James L. McClelland,et al.  An interactive activation model of context effects in letter perception: Part 2. The contextual enhancement effect and some tests and extensions of the model. , 1982, Psychological review.

[3]  Lokendra Shastri,et al.  Semantic Networks and Neural Nets , 1984 .

[4]  Neil Henry.  Latent structure analysis , 1969 .

[5]  H. Simon,et al.  Spurious Correlation: A Causal Interpretation* , 1954 .

[6]  A. A. J. Marley,et al.  The Logic of Decisions. , 1972 .

[7]  Judea Pearl,et al.  Structuring causal trees , 1986, J. Complex..

[8]  Eugene C. Freuder.  A Sufficient Condition for Backtrack-Free Search , 1982, JACM.

[9]  John Douglas Lowrance,et al.  Dependency-graph models of evidential support , 1982 .

[10]  Donald Geman,et al.  Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Judea Pearl,et al.  Convince: A Conversational Inference Consolidation Engine , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[12]  F. R. A. Hopgood,et al.  Machine Intelligence 6 , 1972, The Mathematical Gazette.

[13]  David J. Spiegelhalter,et al.  Probabilistic Reasoning in Predictive Expert Systems , 1985, UAI.

[14]  Alan Bundy,et al.  Proceedings of the Eighth International Joint Conference on Artificial Intelligence , 1983 .

[15]  Azriel Rosenfeld,et al.  Scene Labeling by Relaxation Operations , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[16]  Gary S. Dell,et al.  Positive Feedback in Hierarchical Connectionist Models: Applications to Language Production , 1988, Cogn. Sci..

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

[18]  Judea Pearl,et al.  A Constraint-Propagation Approach to Probabilistic Reasoning , 1985, UAI.

[19]  Victor R. Lesser,et al.  A Retrospective View of the Hearsay-II Architecture , 1977, IJCAI.

[20]  Rina Dechter,et al.  The Anatomy of Easy Problems: A Constraint-Satisfaction Formulation , 1985, IJCAI.

[21]  F. Krauss.  Latent Structure Analysis , 1980 .

[22]  A. Tversky,et al.  Causal Schemata in Judgments under Uncertainty , 1982 .

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

[24]  RICHARD 0. DUDA,et al.  Subjective bayesian methods for rule-based inference systems , 1899, AFIPS '76.

[25]  David L. Waltz,et al.  Generating Semantic Descriptions From Drawings of Scenes With Shadows , 1972 .

[26]  David A. McAllester.  An Outlook on Truth Maintenance. , 1980 .

[27]  J. Kemeny,et al.  Denumerable Markov chains , 1969 .

[28]  Jon Doyle,et al.  A Truth Maintenance System , 1979, Artif. Intell..

[29]  Judea Pearl,et al.  On Evidential Reasoning in a Hierarchy of Hypotheses , 1990, Artif. Intell..