A max-based merging of incommensurable ranked belief bases based on finite scales

2007 10th International Conference on Information Fusion Pub Date : 2007-07-09 DOI:10.1109/ICIF.2007.4408136

S. Benferhat, S. Lagrue, J. Rossit

引用次数: 3

Abstract

Recently, several approaches have been proposed to merge possibly contradictory belief bases. This paper focuses on max-based merging operators applied to incommensurable ranked belief bases. We first propose a characterization of a result of merging using Pareto-like ordering on a set of possible solutions. Then we propose two equivalent ways to recover the result of merging. The first one is based on the notion of compatible rankings defined on finite scales. The second one is only based on total pre-orders induced by ranked bases to merge.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

基于有限尺度的不可通约排序信念基的最大融合

最近，人们提出了几种方法来合并可能相互矛盾的信念基础。研究了基于极大值的合并算子在不可通约排序信念基中的应用。我们首先在一组可能解上用类帕累托排序对合并结果进行了表征。然后，我们提出了两种等效的方法来恢复合并结果。第一种是基于在有限尺度上定义的兼容排名的概念。第二种方法仅基于排名基地合并引起的总预购量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2007 10th International Conference on Information Fusion

自引率

0.00%

发文量

期刊最新文献

Semi-autonomous reference data generation for perception performance evaluation Track association and fusion with heterogeneous local trackers Distributed detection of a nuclear radioactive source using fusion of correlated decisions Distributed data fusion algorithms for tracking a maneuvering target Multi agent systems for flexible and robust Bayesian information fusion