知识卡片

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

有边允许依赖而非强制

理解等级:中级

连接两变量的边允许它们具有直接统计依赖,却不要求任何参数设置下都实际相关。某些势函数可能恰好分解成独立项。图给出模型允许范围,不能把每一条边都解释成已经测得的依赖,更不能直接赋予因果含义。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      By that graph, we mean that there may be a statistical dependency between the two variables. The class of probability distributions depicted here is now more general than the one above, and we can only write that the joint probability as some unknown function of x1 and x2, p(x1, x2) = ϕ12(x1, x2). This graph offers no simplification from the most general probability function of

    参考来源

    - 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第29章《概率图模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c029.xhtml) - 结论依据:摘录中关于有边允许依赖而非强制的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:By that graph, we mean that there may be a statistical dependency between the two variables. The class of probability distributions depicted here is now more general than the one above, and we can only write that the joint probability as some unknown function of x1 and x2, p(x1, x2) = ϕ12(x1, x2). This graph offers no simplification from the most general probability function of