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

通过去除弱相关性降低贝叶斯网络的计算复杂性

Reduction of Computational Complexity in Bayesian Networks through Removal of Weak Dependencies

Uffe Kjærulff

摘要:

本文提出了一种通过识别和去除弱依赖关系(去除(道德化)独立图中的链接)来降低贝叶斯网络计算复杂性的方法。少量链接的移除可以显著地降低计算复杂性,因为若干填充和道德链接可以通过移除而变得多余。该方法描述的独立图,连接树,和潜在的功能与这些方面的影响。使用大型现实世界的网络的方法的实证评估证明了该方法的适用性。此外,该方法,这已实施的Hugin,补充了Jensen和Andersen(1990)提出的近似方法。

英文摘要:

The paper presents a method for reducing the computational complexity of Bayesian networks through identification and removal of weak dependencies (removal of links from the (moralized) independence graph). The removal of a small number of links may reduce the computational complexity dramatically, since several fill-ins and moral links may be rendered superfluous by the removal. The method is described in terms of impact on the independence graph, the junction tree, and the potential functions associated with these. An empirical evaluation of the method using large real-world networks demonstrates the applicability of the method. Further, the method, which has been implemented in Hugin, complements the approximation method suggested by Jensen & Andersen (1990).

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

↑