Learning causal trees from dependence information

Authors:
Dan Geiger;Azaria Paz;Judea Pearl
Affiliations:
Northrop Research and Technology Center, Palos Verdes, CA;Computer Science Department, Israel Institute of Technology, Haifa, Israel;Cognitive Systems Lab., University of California, Los Angeles, CA
Venue:
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 2
Year:
1990

Citing 7
Cited 7

Structuring causal trees

Journal of Complexity
Theories of causal ordering

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

Probabilistic reasoning in intelligent systems: networks of plausible inference
Connectionist learning procedures

Artificial Intelligence
Graphoids: a qualitative framework for probabilistic inference

Graphoids: a qualitative framework for probabilistic inference
Graph Algorithms

Graph Algorithms
Causal networks: semantics and expressiveness

UAI '88 Proceedings of the Fourth Annual Conference on Uncertainty in Artificial Intelligence

Learning polytrees

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
On testing whether an embedded Bayesian network represents a probability model

UAI'94 Proceedings of the Tenth international conference on Uncertainty in artificial intelligence
Using causal information and local measures to learn Bayesian networks

UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
A construction of Bayesian networks from databases based on an MDL principle

UAI'93 Proceedings of the Ninth international conference on Uncertainty in artificial intelligence
Theory refinement on Bayesian networks

UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
A Bayesian method for constructing Bayesian belief networks from databases

UAI'91 Proceedings of the Seventh conference on Uncertainty in Artificial Intelligence
Review: learning bayesian networks: Approaches and issues

The Knowledge Engineering Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

In constructing probabilistic networks from human judgments, we use causal relationships to convey useful patterns of dependencies. The converse task, that of inferring causal relationships from patterns of dependencies, is far less understood. This paper establishes conditions under which the directionality of some interactions can be determined from non-temporal probabilistic information -- an essential prerequisite for attributing a causal interpretation to these interactions. An efficient algorithm is developed that, given data generated by an undisclosed causal polytree, recovers the structure of the underlying polytree, as well as the directionality of all its identifiable links.