Model inference for ranking from pairwise comparisons
By: Daniel Sánchez Catalina, George T. Cantwell
We consider the problem of ranking objects from noisy pairwise comparisons, for example, ranking tennis players from the outcomes of matches. We follow a standard approach to this problem and assume that each object has an unobserved strength and that the outcome of each comparison depends probabilistically on the strengths of the comparands. However, we do not assume to know a priori how skills affect outcomes. Instead, we present an efficient algorithm for simultaneously inferring both the unobserved strengths and the function that maps strengths to probabilities. Despite this problem being under-constrained, we present experimental evidence that the conclusions of our Bayesian approach are robust to different model specifications. We include several case studies to exemplify the method on real-world data sets.
Similar Papers
Learning when to rank: Estimation of partial rankings from sparse, noisy comparisons
Physics and Society
Finds true winners when data is messy.
Multi-team Formation System for Collaborative Crowdsourcing
Social and Information Networks
Forms best teams for group work online.
Efficient Bayesian Inference from Noisy Pairwise Comparisons
Machine Learning (CS)
Makes AI better by learning from people's opinions.