← 返回刚才阅读的位置

知识卡片

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

因果DAG表示机制关系假设

理解等级:初级

因果DAG用节点表示所选变量,用有向边表示直接因果关系,并要求无有向环。节点可以是标量、类别、向量或矩阵。把图称为因果图是在作关于DGP的假设,不是对图结构已由数据证实的声明。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      A causal DAG is a directed graph where the nodes are this set of variables and the directed edges represent the causal relationships between them. When we use a causal DAG to represent the DGP, we assume the edges reflect true causality in the DGP.

    参考来源

    - 位置:《Causal AI》第03章《构建因果图模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-3.xhtml) - 结论依据:摘录中关于因果DAG表示机制关系假设的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:A causal DAG is a directed graph where the nodes are this set of variables and the directed edges represent the causal relationships between them. When we use a causal DAG to represent the DGP, we assume the edges reflect true causality in the DGP.