Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework (Q2321275): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TETRAD / rank | |||
Normal rank | |||
Revision as of 18:15, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework |
scientific article |
Statements
Separators and adjustment sets in causal graphs: complete criteria and an algorithmic framework (English)
0 references
28 August 2019
0 references
causal inference
0 references
covariate adjustment
0 references
ancestral graphs
0 references
d-separation
0 references
m-separation
0 references
complexity
0 references
Bayesian network
0 references
knowledge representation
0 references
