{"title":"基于有限尺度的不可通约排序信念基的最大融合","authors":"S. Benferhat, S. Lagrue, J. Rossit","doi":"10.1109/ICIF.2007.4408136","DOIUrl":null,"url":null,"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.","PeriodicalId":298941,"journal":{"name":"2007 10th International Conference on Information Fusion","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A max-based merging of incommensurable ranked belief bases based on finite scales\",\"authors\":\"S. Benferhat, S. Lagrue, J. Rossit\",\"doi\":\"10.1109/ICIF.2007.4408136\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":298941,\"journal\":{\"name\":\"2007 10th International Conference on Information Fusion\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 10th International Conference on Information Fusion\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIF.2007.4408136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 10th International Conference on Information Fusion","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIF.2007.4408136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A max-based merging of incommensurable ranked belief bases based on finite scales
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
