Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows

Abstract

We address the problem of rank elicitation as-suming that the underlying data generating pro-cess is characterized by a probability distribu-tion on the set of all rankings (total orders) of a given set of items. Instead of asking for complete rankings, however, our learner is only allowed to query pairwise preferences. Using information of that kind, the goal of the learner is to reliably predict properties of the distribution, such as the most probable top-item, the most probable rank-ing, or the distribution itself. More specifically, learning is done in an online manner, and the goal is to minimize sample complexity while guaran-teeing a certain level of confidence.
Fichier principal
Vignette du fichier
BuHuSz14.pdf (556.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01079369 , version 1 (01-11-2014)

Identifiers

  • HAL Id : hal-01079369 , version 1

Cite

Róbert Busa-Fekete, Eyke Hüllermeier, Balázs Szörényi. Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows. Proceedings of The 31st International Conference on Machine Learning, Jun 2014, Beijing, China. ⟨hal-01079369⟩
248 View
302 Download

Share

Gmail Facebook X LinkedIn More