偏序偏好排序之间的距离
Distances Between Partial Preference Orderings
AI总结:
本文提出两种计算偏序偏好排序距离的方法:基于组合学的暴力法和基于 belief functions 的方法,后者有效规避了高维问题的组合复杂度限制。
摘要:
本文提出基于两种截然不同的方法来建立偏序偏好排序之间的距离。第一种方法对应基于组合学的暴力方法。它生成所有与偏序偏好排序兼容的完整偏好排序,并计算所有完全兼容偏好排序之间的 Frobenius 距离。遗憾的是,由于组合复杂度较大,这第一种方法在求解高维问题时效率不高。这就是为什么我们提出使用第二种基于 belief functions 的方法来规避此问题,该方法能够充分建模偏序偏好排序的缺失信息。这第二种距离计算方法不受组合复杂度限制的困扰。我们通过简单的例子展示了这两种理论方法是如何工作的。
英文摘要:
This paper proposes to establish the distance between partial preference orderings based on two very different approaches. The first approach corresponds to the brute force method based on combinatorics. It generates all possible complete preference orderings compatible with the partial preference orderings and calculates the Frobenius distance between all fully compatible preference orderings. Unfortunately, this first method is not very efficient in solving high-dimensional problems because of its big combinatorial complexity. That is why we propose to circumvent this problem by using a second approach based on belief functions, which can adequately model the missing information of partial preference orderings. This second approach to the calculation of distance does not suffer from combinatorial complexity limitation. We show through simple examples how these two theoretical methods work.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。