冲突在贝叶斯网络搜索中的应用
The use of conflicts in searching Bayesian networks
摘要:
本文讨论了如何冲突(所使用的一致性为基础的诊断社区)可以适应用于基于搜索的算法计算先验和后验概率离散贝叶斯网络。这是一个“随时”算法,在任何阶段都可以估计概率并给出误差界。鉴于最流行的贝叶斯网络算法利用网络的结构来提高效率,我们利用概率分布来提高效率;这种算法最适合于极端概率的情况。本文提出了一种解决方案,在天真的算法中发现的效率低下,并显示如何基于一致性的诊断社区(即冲突)的工具,可以有效地使用,以提高效率。具有数万个节点的网络的实证结果。
英文摘要:
This paper discusses how conflicts (as used by the consistency-based diagnosis community) can be adapted to be used in a search-based algorithm for computing prior and posterior probabilities in discrete Bayesian Networks. This is an "anytime" algorithm, that at any stage can estimate the probabilities and give an error bound. Whereas the most popular Bayesian net algorithms exploit the structure of the network for efficiency, we exploit probability distributions for efficiency; this algorithm is most suited to the case with extreme probabilities. This paper presents a solution to the inefficiencies found in naive algorithms, and shows how the tools of the consistency-based diagnosis community (namely conflicts) can be used effectively to improve the efficiency. Empirical results with networks having tens of thousands of nodes are presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。