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

使敏感性分析计算效率更高

Making Sensitivity Analysis Computationally Efficient

Aalborg University(奥尔堡大学);Utrecht University(乌得勒支大学)

Uffe Kjærulff, Linda C. van der Gaag

摘要:

为了研究贝叶斯网络的输出概率的鲁棒性,可以执行灵敏度分析。单向灵敏度分析针对网络的每个概率参数建立一个函数,该函数表示根据该参数的后验边缘感兴趣概率。当前用于计算这样的函数中的系数的方法依赖于大量的网络评估。在本文中,我们提出了一种方法,只需要一个单一的向外传播的连接树中建立的所有可能的参数的函数中的系数,此外,需要一个向内的传播处理证据。相反,该方法需要一个单一的向外传播计算的系数在一个单一的参数表示所有可能的后边缘的函数。我们将这些结果扩展到n路灵敏度分析中的参数集进行了研究。

英文摘要:

To investigate the robustness of the output probabilities of a Bayesian network, a sensitivity analysis can be performed. A one-way sensitivity analysis establishes, for each of the probability parameters of a network, a function expressing a posterior marginal probability of interest in terms of the parameter. Current methods for computing the coefficients in such a function rely on a large number of network evaluations. In this paper, we present a method that requires just a single outward propagation in a junction tree for establishing the coefficients in the functions for all possible parameters; in addition, an inward propagation is required for processing evidence. Conversely, the method requires a single outward propagation for computing the coefficients in the functions expressing all possible posterior marginals in terms of a single parameter. We extend these results to an n-way sensitivity analysis in which sets of parameters are studied.

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

↑