.png){kind=icon}
返回
Exploiting case-based independence for approximating marginal probabilities
.png){kind=icon}
PRE
AI
DOI：10.1016/0888-613X(95)00112-T.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Computing marginal probabilities in Bayes networks is a hard problem. Deterministic anytime approximation schemes accumulate the probability mass in a small number of value assignments to the network variables. Under certain assumptions, the probability mass in the assignments is sufficient to obtain a good approximation. Such methods are especially useful for highly connected networks, where the topology makes the exact algorithms intractable. Bayes networks often possess a fine independence structure not evident from the topology, but apparent in local conditional distributions Independence-based (IB) assignments, originally proposed as a theory of abduction, take advantage of such independence, and thus contain fewer assigned variables-and more probability mass. We present several algorithms that use IB assignments for approximating marginal probabilities. Experimental results suggest that this approach is feasible for highly connected belief networks.
Keyword:
probabilistic reasoning
Bayesian belief networks
approximate belief updating
approximating marginal probabilities
anytime algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
暂无机构信息
引用论文
.png){kind=icon}
Crystal chemistry and metal-hydrogen bonding in anisotropic and interstitial hydrides of intermetallics of rare earth (R) and transition metals (T), RT3 and R2T7稀土 (R) 和过渡金属 (T) 的金属间化合物的各向异性和间隙氢化物中的晶体化学和金属氢键，RT3 和R2T7
PREAI
分享收藏
查看更多内容