arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1302.1553cs.AI
收藏

嵌套连接树

Nested Junction Trees

Aalborg University(奥尔堡大学)

Uffe Kjærulff

摘要:

Hugin和Shafer-Shenoy架构中的推理效率可以通过利用集团传入消息引起的独立关系来提高。也就是说,要从集团发送的消息可以经由以连接树的形式的集团势的因式分解来计算。在本文中,我们表明,通过利用这种嵌套的连接树在计算的消息,传统的传播方法的空间和时间成本可能会减少。本文提出了一种结构化的方式利用嵌套连接树技术来实现这种减少。该方法的实用性强调通过一个彻底的实证评估,涉及10个大型现实世界的贝叶斯网络和Hugin推理算法。

英文摘要:

The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy architectures can be improved by exploiting the independence relations induced by the incoming messages of a clique. That is, the message to be sent from a clique can be computed via a factorization of the clique potential in the form of a junction tree. In this paper we show that by exploiting such nested junction trees in the computation of messages both space and time costs of the conventional propagation methods may be reduced. The paper presents a structured way of exploiting the nested junction trees technique to achieve such reductions. The usefulness of the method is emphasized through a thorough empirical evaluation involving ten large real-world Bayesian networks and the Hugin inference algorithm.

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

↑