知识卡片
演算完备性有问题范围
图识别通常称非参数识别,因为不额外规定结构函数的具体参数形式。相应算法的完备性针对指定图模型、可用分布和查询类别,不能扩展成所有反事实问题、所有函数假设都能由这三条规则决定。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 识别与因果层级
原书出处 · 1 处
- · 查看原书依据
10.4 Graphical identification with the do-calculus Graphical identification (sometimes called nonparametric identification) refers to identification techniques that rely on reasoning over the DAG. One of the most well-known approaches to graphical identification is the do-calculus, a set of three rules used for identification with causal graphs. The rules use graph surgery and d-separation to determine cases when you can replace causal terms like IE=e with
参考来源
- 位置:《Causal AI》第10章《识别与因果层级》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-10.xhtml)
- 结论依据:摘录中关于演算完备性有问题范围的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:10.4 Graphical identification with the do-calculus Graphical identification (sometimes called nonparametric identification) refers to identification techniques that rely on reasoning over the DAG. One of the most well-known approaches to graphical identification is the do-calculus, a set of three rules used for identification with causal graphs. The rules use graph surgery and d-separation to determine cases when you can replace causal terms like IE=e with