1993
DOI: 10.1007/978-1-4612-2748-9
|View full text |Cite
|
Sign up to set email alerts
|

Causation, Prediction, and Search

Abstract: To Martha, for her support and loveR .S. One source of the ideas in this book is in work we began ten years ago at the University of Pittsburgh. We drew many ideas about causality, statistics and search from the psychometric, economic and sociological literature, beginning with Charles Spearman's project at the turn of the century and including the work of Herbert Simon, Hubert Blalock and Herbert Costner. We obtained a new perspective on the enterprise from Judea Pearl's Probabilistic Reasoning in Intelligent… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

11
2,188
0
15

Year Published

1997
1997
2005
2005

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 2,410 publications
(2,224 citation statements)
references
References 123 publications
11
2,188
0
15
Order By: Relevance
“…In the first two experiments, the model was semideterministic such that a cause could occur without its effect (e.g., P[P͉E] Ͻ 1) but an effect could not occur without its cause (e.g., P[P͉ϳE] ϭ 0). One feature of such a semideterministic chain model is that it cannot be learned by constraint-based algorithms (e.g., TETRAD; see Spirtes et al, 1993) that infer graph structure from the determination of pairwise unconditional and conditional dependencies. This is because such an algorithm needs to compute all the relevant conditional independencies in the generated data, but some of these will be undefined when the learning set is semideterministic.…”
Section: Methodsmentioning
confidence: 99%
See 4 more Smart Citations
“…In the first two experiments, the model was semideterministic such that a cause could occur without its effect (e.g., P[P͉E] Ͻ 1) but an effect could not occur without its cause (e.g., P[P͉ϳE] ϭ 0). One feature of such a semideterministic chain model is that it cannot be learned by constraint-based algorithms (e.g., TETRAD; see Spirtes et al, 1993) that infer graph structure from the determination of pairwise unconditional and conditional dependencies. This is because such an algorithm needs to compute all the relevant conditional independencies in the generated data, but some of these will be undefined when the learning set is semideterministic.…”
Section: Methodsmentioning
confidence: 99%
“…A formal framework for causal inference based on causal Bayes networks has been recently developed (Pearl, 2000;Spirtes, Glymour, & Schienes, 1993). This approach clarifies the relation between the probabilistic dependencies present in a set of data and the causal models that could have generated that data.…”
Section: Computational Models Of Structure Learningmentioning
confidence: 99%
See 3 more Smart Citations