Skip to Main content Skip to Navigation

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

Róbert Busa-Fekete 1 Eyke Hüllermeier 2 Balázs Szörényi 3, 1
3 SEQUEL - Sequential Learning
LIFL - Laboratoire d'Informatique Fondamentale de Lille, LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal, Inria Lille - Nord Europe
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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://hal.inria.fr/hal-01079369
Contributor : Balazs Szorenyi <>
Submitted on : Saturday, November 1, 2014 - 11:49:18 AM
Last modification on : Tuesday, November 26, 2019 - 4:12:08 PM
Document(s) archivé(s) le : Monday, February 2, 2015 - 4:52:08 PM

File

BuHuSz14.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01079369, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

348

Files downloads

320