原书出处
Causal AI
We’ll define d-separation now. First, two nodes u and v are said to be d-separated (blocked) by Z if all paths between them are d-separated by Z. If any of those paths between u and v are not d-separated, then u and v are d-connected.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-4.xhtml
EPUB SHA-256:e55e7dc9d7966ea79311f2bc8d5bef7371a6dbb65240f11a2b3e44180b934e72