# Similarity of personal preferences: Theoretical foundations and empirical analysis

@article{Ha2003SimilarityOP, title={Similarity of personal preferences: Theoretical foundations and empirical analysis}, author={Vu A. Ha and P. Haddawy}, journal={Artif. Intell.}, year={2003}, volume={146}, pages={149-173} }

We study the problem of defining similarity measures on preferences from a decision-theoretic point of view. We propose a similarity measure, called probabilistic distance, that originates from the Kendall's tau function, a well-known concept in the statistical literature. We compare this measure to other existing similarity measures on preferences. The key advantage of this measure is its extensibility to accommodate partial preferences and uncertainty. We develop efficient methods to compute… Expand

#### 49 Citations

Probabilistic Evaluation of Preference Aggregation Functions: A Statistical Approach in Social Choice Theory

- Mathematics
- 2016

A statistical criterion for evaluating the appropriateness of preference aggregation functions for a fixed group of persons is introduced. Specifically, we propose a method comparing aggregation… Expand

Predicting User Preferences Via Similarity-Based Clustering

- Computer Science
- Canadian Conference on AI
- 2008

This paper explores the idea of clustering partial preference relations as a means for agent prediction of users' preferences by exploiting the notion that people with common preferences over a given set of outcomes will likely have common interests over other outcomes. Expand

A study of similarity measures through the paradigm of measurement theory: the classic case

- Computer Science
- Soft Comput.
- 2019

The paper aims at providing information on similarity measures that can help in choosing “a priori” one of them on the basis of the semantics behind this choice, from the point of view of the ranking relation they induce on object pairs. Expand

du CNRC ( NPArC ) Predicting User Preferences via Similarity-Based Clustering

- 2010

This paper explores the idea of clustering partial preference relations as a means for agent prediction of users’ preferences. Due to the high number of possible outcomes in a typical scenario, such… Expand

Distance based preference relations

- Mathematics
- 2005 International Conference on Machine Learning and Cybernetics
- 2005

The main contribution of this paper is the definition of a new preference relation, called distance-based preference relation. It allows us to represent the preferential gaps between the… Expand

Learning User Preference Models under Uncertainty for Personalized Recommendation

- 2006

Preference modeling has a crucial role in customer relationship management systems. Traditional approaches to preference modeling are based on decision and utility theory by explicitly querying users… Expand

Pairwise Preference Learning and Ranking

- Computer Science
- ECML
- 2003

The main objective of this work is to investigate the trade-off between the quality of the induced ranking function and the computational complexity of the algorithm, both depending on the amount of preference information given for each example. Expand

User preferences discovery using fuzzy models

- Mathematics, Computer Science
- Fuzzy Sets Syst.
- 2010

The results of the simulation evaluation revealed that the proposed preference discovery method doubled the accuracy of preference discovery as compared to random prediction; and outperformed conventional techniques in making movie recommendation. Expand

Label ranking by learning pairwise preferences

- Mathematics, Computer Science
- Artif. Intell.
- 2008

This work shows that a simple (weighted) voting strategy minimizes risk with respect to the well-known Spearman rank correlation and compares RPC to existing label ranking methods, which are based on scoring individual labels instead of comparing pairs of labels. Expand

Knowledge-based acquisition of tradeoff preferences for negotiating agents

- Business, Computer Science
- ICEC '03
- 2003

It is identified that user trade-off preferences play a fundamental role in negotiation in general and another method is developed to remove the limitation of the high user workload of the exhaustive method. Expand

#### References

SHOWING 1-10 OF 50 REFERENCES

Preference Elicitation via Theory Refinement

- Computer Science
- J. Mach. Learn. Res.
- 2003

We present an approach to elicitation of user preference models in which assumptions can be used to guide but not constrain the elicitation process. We demonstrate that when domain knowledge is… Expand

The Decision-Theoretic Interactive Video Advisor

- Computer Science
- UAI
- 1999

DIVA is described, a decision-theoretic agent for recommending movies that contains a number of novel features and has a rich representation of preference, distinguishing between a user's general taste in movies and his immediate interests. Expand

Utility Elicitation as a Classification Problem

- Computer Science, Mathematics
- UAI
- 1998

This work attempts to identify the new user's utility function based on classification relative to a database of previously collected utility functions by identifying clusters of utility functions that minimize an appropriate distance measure. Expand

Empirical Analysis of Predictive Algorithms for Collaborative Filtering

- Computer Science
- UAI
- 1998

Several algorithms designed for collaborative filtering or recommender systems are described, including techniques based on correlation coefficients, vector-based similarity calculations, and statistical Bayesian methods, to compare the predictive accuracy of the various methods in a set of representative problem domains. Expand

A Hybrid Approach to Reasoning with Partially Elicited Preference Models

- Computer Science, Mathematics
- UAI
- 1999

This work shows how comparative statements about classes of decision alternatives can be used to further constrain the utility function and thus identify supoptimal alternatives, and demonstrates that quantitative and qualitative approaches can be synergistically integrated to provide effective and flexible decision support. Expand

Prospect theory: analysis of decision under risk

- Economics
- 1979

Analysis of decision making under risk has been dominated by expected utility theory, which generally accounts for people's actions. Presents a critique of expected utility theory as a descriptive… Expand

Parametric models of the utility of survival duration: Tests of axioms in a generic utility framework

- Mathematics
- 1989

Abstract The risk posture of a utility function is, roughly speaking, a measure of the curvature of the utility function with respect to an objectively quantified dimension like money or survival… Expand

Theory of Games and Economic Behavior

- Economics
- Nature
- 1946

THIS book is based on the theory that the economic man attempts to maximize his share of the world's goods and services in the same way that a participant in a game involving many players attempts to… Expand

Faster random generation of linear extensions

- Computer Science, Mathematics
- SODA '98
- 1998

This paper defines a slightly different Markov chain, and presents a very simple proof of its rapid mixing, using the method of path coupling, which significantly improves the previous best bound for this problem, which was a bound of O( n 5 log n ), for the Karzanov and Khachiyan chain. Expand

Metric Methods for Analyzing Partially Ranked Data

- Mathematics
- 1986

I. Introduction and Outline.- II. Metrics on Fully Ranked Data.- A. Permutations: Some Important Conventions.- B. Metrics on Permutations: Discussion and Exampl es.- C. The Requirement of… Expand