登普斯特-沙弗理论
信念结构
灵活性(工程)
计算机科学
区间(图论)
优先次序
人工智能
数学
算法
数据挖掘
统计
组合数学
工程类
管理科学
出处
期刊:IEEE transactions on systems, man, and cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2000-01-01
卷期号:30 (5): 526-536
被引量:19
摘要
The Dempster's rule of combination is a widely used technique to integrate evidence collected from different sources. In this paper, it is shown that the values of certain functions defined on a family of belief structures decrease (by scale factors depending on the degree of conflict) when the belief structures are combined according to the Dempster's rule. Similar results also hold when an arbitrary belief structure is prioritized while computing the combination. Furthermore, the length of the belief-plausibility interval is decreased during a nonhierarchical aggregation of belief structures. Several types of inheritance networks are also proposed each of which allows considerable flexibility in the choice of prioritization.
科研通智能强力驱动
Strongly Powered by AbleSci AI