知识卡片
正分布连接独立与团分解
Hammersley–Clifford定理在严格正概率等适用条件下,将无向图的马尔可夫性质与团势乘积分解联系起来。一般写为p(x)=Z⁻¹∏cψc(xc),Z保证总概率为1。势函数不必各自是归一化概率;包含零概率配置时不能不加条件套用该等价结论。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 概率图模型
原书出处 · 1 处
- · 查看原书依据
The Hammersley-Clifford theorem [182] states that a positive probability distribution has the independence structure described by a graphical model if and only if it can be written as a product of functions over the variables of each maximal clique:
参考来源
- 位置:《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)
- 结论依据:摘录中关于正分布连接独立与团分解的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:The Hammersley-Clifford theorem [182] states that a positive probability distribution has the independence structure described by a graphical model if and only if it can be written as a product of functions over the variables of each maximal clique: