首页> 外文学位 >A unified framework for evidential reasoning.
【24h】

A unified framework for evidential reasoning.

机译:证据推理的统一框架。

获取原文
获取原文并翻译 | 示例

摘要

A unified framework for evidential reasoning is proposed. In this framework, uncertainties are represented by intervals and modeled by belief functions. The procedure for belief conjunction is proposed. The belief combination and belief propagation are shown to be special cases of belief conjunction. By properly representing evidence in the common framework, belief combination is shown to be the belief conjunction procedure plus the normalization process. When evidence are independent, the belief combination procedure is equivalent to Dempster's rule of combination. The result of the belief propagation procedure is shown to be an interpolation between total ignorance and the uncertainty associated with the rule. The belief propagation procedure is shown to be associative but not commutative. The associativity of belief propagation implies the existence of chaining syllogism.;The evidential framework is extended to handle dependent evidence. An ad-hoc interpolative procedure for belief conjunction and belief combination of dependent evidence with degree of dependency ;A modification to Dempster's rule is proposed to ovecome the counter-intuitive results due to the normalization process. A new interpretation for the rules in the framework is proposed. It is shown that this interpretation yields tighter intervals for belief propagation procedure while maintaining the interpolative property. This interpretation is extended to fuzzy sets and approximate reasoning. It is shown that the proposed belief propagation procedure is a further generalization of Zadeh's generalized modus ponens.;Some aspects of the complexity issue in the belief function approach are discussed. It is shown that, when the hypotheses space is hierarchically structured, then any basic probability assignment function whose focal elements are nodes in the hierarchy is a separable belief function. Furthermore, this separable belief function can be decomposed into simple support functions in polynomial time.
机译:提出了证据推理的统一框架。在此框架中,不确定性由区间表示,并由置信函数建模。提出了信念连接的程序。信念组合和信念传播被证明是信念联合的特例。通过在通用框架中正确表示证据,信念组合被证明是信念联合过程加上规范化过程。当证据独立时,信念组合程序等同于Dempster的组合规则。信念传播过程的结果显示为总无知和与规则相关的不确定性之间的插值。信念传播过程显示为关联但非可交换的。信念传播的关联性暗示了链式三段论的存在。依存度的依存证据的信念合取和信念组合的临时插值过程;对归因斯特规则的修改提出了修正意见,以归因于归一化过程而产生的反直觉结果。提出了对框架中规则的新解释。结果表明,这种解释在保持插值特性的同时,为信念传播过程产生了更紧密的间隔。这种解释扩展到模糊集和近似推理。结果表明,所提出的信念传播过程是对Zadeh广义模态桥的进一步推广。;讨论了信念函数方法中复杂性问题的某些方面。结果表明,假设空间是层次结构的,那么焦点元素是层次结构中节点的基本概率分配函数就是一个可分离的置信函数。此外,该可分离的置信函数可以在多项式时间内分解为简单的支持函数。

著录项

  • 作者

    Hau, Hai-Yen.;

  • 作者单位

    Purdue University.;

  • 授予单位 Purdue University.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 1988
  • 页码 201 p.
  • 总页数 201
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号