A graph-based inference method for conditional independence

Authors:
Ross D. Shachter
Affiliations:
Department of Engineering-Economic Systems, Stanford University, Stanford, CA
Venue:
UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Year:
1991

Citing 9
Cited 0

Fusion, propagation, and structuring in belief networks

Artificial Intelligence
Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic inference and influence diagrams

Operations Research
Axioms and algorithms for inferences involving probabilistic independence

Information and Computation
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Causal networks: semantics and expressiveness

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
On the logic of causal models

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence
d-Separation: From Theorems to Algorithms

UAI '89 Proceedings of the Fifth Annual Conference on Uncertainty in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

The graphoid axioms for conditional independence, originally described by Dawid [1979], are fundamental to probabilistic reasoning [Pearl, 1988]. Such axioms provide a mechanism for manipulating conditional independence assertions without resorting to their numerical definition. This paper explores a representation for independence statements using multiple undirected graphs and some simple graphical transformations. The independence statements derivable in this system are equivalent to those obtainable by the graphoid axioms. Therefore, this is a purely graphical proof technique for conditional independence.