作为转换概率的证据确证
Evidential Confirmation as Transformed Probability
摘要:
人工智能领域的大量工作都涉及到为一组共同的命题聚集确认性和不确认性证据的措施。声称经典概率是不充分或不适当的,一些研究人员甚至发明了新的形式和方法。我们将展示如何代表两个主要的这种替代方法,不仅在转换(贝叶斯)概率方面的证据确认,但也在对方。这统一了证实理论的两种主要方法,通过表明修订的MYCIN不确定性因子方法[12]等价于Dempster-Shafer理论的特殊情况。它产生了一个很好理解的公理基础,即条件独立性,解释以前的工作定量证实理论。它实质上解决了先验的“征税或留下”问题:MYCIN不得不把它们排除在外,而PROSPECTOR不得不把它们放进去。它重述了一些确认理论的优势,在心理上的可及性概率信息在不同的(转换)格式。最后,它有助于统一不确定推理的表示(参见[11])。
英文摘要:
A considerable body of work in AI has been concerned with aggregating measures of confirmatory and disconfirmatory evidence for a common set of propositions. Claiming classical probability to be inadequate or inappropriate, several researchers have gone so far as to invent new formalisms and methods. We show how to represent two major such alternative approaches to evidential confirmation not only in terms of transformed (Bayesian) probability, but also in terms of each other. This unifies two of the leading approaches to confirmation theory, by showing that a revised MYCIN Certainty Factor method [12] is equivalent to a special case of Dempster-Shafer theory. It yields a well-understood axiomatic basis, i.e. conditional independence, to interpret previous work on quantitative confirmation theory. It substantially resolves the "taxe-them-or-leave-them" problem of priors: MYCIN had to leave them out, while PROSPECTOR had to have them in. It recasts some of confirmation theory's advantages in terms of the psychological accessibility of probabilistic information in different (transformed) formats. Finally, it helps to unify the representation of uncertain reasoning (see also [11]).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。