Definition 3.4 (d-separation) Two (sets of) nodes 𝑋 and 𝑌 are d-separated by a set of nodes 𝑍 if all of the paths between (any node in) 𝑋 and (any node in) 𝑌 are blocked by 𝑍
Source: Pearl (1988), Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
If you want to change selection, open document below and click on "Move attachment"
- (no access) - Introduction_to_Causal_Inference-Nov19_2020-Neal.pdf, p37
|status||not read|| ||reprioritisations|
|last reprioritisation on|| ||suggested re-reading day|
|started reading on|| ||finished reading on|