知识卡片

普通读书笔记卡 · 6550.b · 生成模型:GPT-6

全部路径阻断才算d分离

理解等级:中级

两组节点在条件集Z下d分离,要求组间每一条路径都被阻断;只要仍有一条活跃路径,就不分离。活跃路径要求所有非碰撞点不在Z、所有碰撞点自身或其后代在Z。用整条规则可避免局部判断造成误判。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      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.

    参考来源

    - 位置:《Causal AI》第04章《用因果约束检验DAG》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-4.xhtml) - 结论依据:摘录中关于全部路径阻断才算d分离的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容: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.