一种基于活动元组的后验信念定界方法
Active Tuples-based Scheme for Bounding Posterior Beliefs
摘要:
本文提出了一种计算离散变量贝叶斯网络后验边缘上、下界的方法。它的力量在于它能够使用任何可用的方案,限制证据或后边缘的概率,并以随时随地的方式提高其性能。该计划使用割集条件原理,收紧现有的边界计划,并促进随时的行为,利用固定数量的割集元组。边界的准确性随着所使用的割集元组的数量的增加而提高,并且计算时间也增加。我们证明经验的价值,我们的计划,有界的后边缘和概率的证据,使用一个变种的约束传播算法作为一个插件计划。
英文摘要:
The paper presents a scheme for computing lower and upper bounds on the posterior marginals in Bayesian networks with discrete variables. Its power lies in its ability to use any available scheme that bounds the probability of evidence or posterior marginals and enhance its performance in an anytime manner. The scheme uses the cutset conditioning principle to tighten existing bounding schemes and to facilitate anytime behavior, utilizing a fixed number of cutset tuples. The accuracy of the bounds improves as the number of used cutset tuples increases and so does the computation time. We demonstrate empirically the value of our scheme for bounding posterior marginals and probability of evidence using a variant of the bound propagation algorithm as a plug-in scheme.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。