Logo Logo
Switch Language to German

Busa-Fekete, Róbert; Hüllermeier, Eyke ORCID logoORCID: https://orcid.org/0000-0002-9944-4108 and Szörényi, Balázs (2014): Preference-Based Rank Elicitation using Statistical Models: The Case of Mallows. 31st International Conference on Machine Learning (ICML 2014), Beijing, China, 21-26 June, 2014. Xing, Eric P. and Jebara, Tony (eds.) : In: Proceedings of the 31st International Conference on Machine Learning, Vol. 32, No. 2 Bejing, China: PMLR. pp. 1071-1079

Full text not available from 'Open Access LMU'.


We address the problem of rank elicitation assuming that the underlying data generating process is characterized by a probability distribution 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 ranking, or the distribution itself. More specifically, learning is done in an online manner, and the goal is to minimize sample complexity while guaranteeing a certain level of confidence.

Actions (login required)

View Item View Item