原书出处
Causal AI
Let’s define d-separation for a path. A path P is d-separated by node set Z if any of four criteria are met. P contains a chain, i → m → j, such that the middle node m is in Z. P contains a chain, i ← m ← j, such that the middle node m is in Z. P contains a child-parent-child structure i ←
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-4.xhtml
EPUB SHA-256:e55e7dc9d7966ea79311f2bc8d5bef7371a6dbb65240f11a2b3e44180b934e72