.png){kind=icon}
.png){kind=icon}
Return
Model-Based Learning from Preference Data
.png){kind=icon}
OA
AI
DOI：10.1146/annurev-statistics-031017-100213.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Preference data occur when assessors express comparative opinions about a set of items, by rating, ranking, pair comparing, liking, or clicking. The purpose of preference learning is to (a) infer on the shared consensus preference of a group of users, sometimes called rank aggregation, or (b) estimate for each user her individual ranking of the items, when the user indicates only incomplete preferences; the latter is an important part of recommender systems. We provide an overview of probabilistic approaches to preference learning, including the Mallows, Plackett-Luce, and Bradley-Terry models and collaborative filtering, and some of their variations. We illustrate, compare, and discuss the use of these methods by means of an experiment in which assessors rank potatoes, and with a simulation. The purpose of this article is not to recommend the use of one best method but to present a palette of different possibilities for different questions and different types of data.
Keywords:
preference learning with uncertainty
Mallows model
Plackett-Luce model
recommender systems
Bayesian inference
Bradley-Terry model
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.7
Papers:
211
Citations:
2.4K
Organization
View more organizations