证据不变的灵敏度界限
Evidence-invariant Sensitivity Bounds
摘要:
概率网络的敏感性分析所揭示的敏感性通常取决于输入的证据。因此,对于现实生活中的网络,分析要执行多次,使用不同的证据。虽然存在灵敏度分析的有效算法,但由于观测值的可能组合范围很大,因此完整的分析通常是不可行的。在本文中,我们提出了一种方法来研究的敏感性是不变的证据输入。我们的方法建立在建立边界的思想之上,在边界之间可以改变参数,而不会引起感兴趣的变量的最可能值的变化。
英文摘要:
The sensitivities revealed by a sensitivity analysis of a probabilistic network typically depend on the entered evidence. For a real-life network therefore, the analysis is performed a number of times, with different evidence. Although efficient algorithms for sensitivity analysis exist, a complete analysis is often infeasible because of the large range of possible combinations of observations. In this paper we present a method for studying sensitivities that are invariant to the evidence entered. Our method builds upon the idea of establishing bounds between which a parameter can be varied without ever inducing a change in the most likely value of a variable of interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。