Learning Causal Trees from Dependence Information

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. Th’ 1s 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.

Authors

• Dan Geiger Jeffrey A. Barnett

Keywords

No keywords are indexed for this paper.