Distances Between Partial Preference Orderings
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Concordance and the Smallest Covering Set of Preference Orderings
Preference orderings are orderings of a set of items according to the preferences (of judges). Such orderings arise in a variety of domains, including group decision making, consumer marketing, voting and machine learnin…
Decision MakingMarketingConditions for Social Preference Transitivity When Cycle Involved and A $\hat{O}\mbox{-}\hat{I}$ Framework
We present some conditions for social preference transitivity under the majority rule when the individual preferences include cycles. First, our concern is with the restriction on the preference orderings of individuals …
Learning from Preferences and Mixed Demonstrations in General Settings
Reinforcement learning is a general method for learning in sequential settings, but it can often be difficult to specify a good reward function when the task is complex. In these cases, preference feedback or expert demo…
Reinforcement LearningCPMetric: Deep Siamese Networks for Learning Distances Between Structured Preferences
Preference are central to decision making by both machines and humans. Representing, learning, and reasoning with preferences is an important area of study both within computer science and across the sciences. When worki…
Decision MakingMetric LearningWormhole Loss for Partial Shape Matching
When matching parts of a surface to its whole, a fundamental question arises: Which points should be included in the matching process? The issue is intensified when using isometry to measure similarity, as it requires th…