arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.7398cs.AI
收藏

连接树中的惰性传播

Lazy Propagation in Junction Trees

Aalborg University(奥尔堡大学)

Anders L. Madsen, Finn Verner Jensen

摘要:

贝叶斯网络中利用二级结构进行概率推理的算法可以通过利用证据诱导的独立关系和原网络中链接的方向来提高效率。在本文中,我们提出了一种算法,在线利用独立关系诱导的证据和方向的链接在原始网络中,以减少时间和空间成本。而不是乘的条件概率分布的各种集团,我们在线确定哪些潜力倍增时,一个消息是要产生的。该算法的性能改进强调通过经验评估涉及大型现实世界的贝叶斯网络,我们比较的方法与HUGIN和Shafer-Shenoy推理算法。

英文摘要:

The efficiency of algorithms using secondary structures for probabilistic inference in Bayesian networks can be improved by exploiting independence relations induced by evidence and the direction of the links in the original network. In this paper we present an algorithm that on-line exploits independence relations induced by evidence and the direction of the links in the original network to reduce both time and space costs. Instead of multiplying the conditional probability distributions for the various cliques, we determine on-line which potentials to multiply when a message is to be produced. The performance improvement of the algorithm is emphasized through empirical evaluations involving large real world Bayesian networks, and we compare the method with the HUGIN and Shafer-Shenoy inference algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑