Active Ranking using Pairwise Comparisons

09/16/2011
by   Kevin G. Jamieson, et al.
0

This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log_2 n pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, we assume that the objects can be embedded into a d-dimensional Euclidean space and that the rankings reflect their relative distances from a common reference point in R^d. We show that under this assumption the number of possible rankings grows like n^2d and demonstrate an algorithm that can identify a randomly selected ranking using just slightly more than d log n adaptively selected pairwise comparisons, on average. If instead the comparisons are chosen at random, then almost all pairwise comparisons must be made in order to identify any ranking. In addition, we propose a robust, error-tolerant algorithm that only requires that the pairwise comparisons are probably correct. Experimental studies with synthetic and real datasets support the conclusions of our theoretical analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/20/2014

Spectral Ranking using Seriation

We describe a seriation algorithm for ranking a set of items given pairw...
research
06/30/2022

Fast computation of rankings from pairwise comparisons

We study the ranking of individuals, teams, or objects on the basis of p...
research
10/25/2020

Monocular Depth Estimation via Listwise Ranking using the Plackett-Luce Model

In many real-world applications, the relative depth of objects in an ima...
research
02/10/2022

Decreasing Annotation Burden of Pairwise Comparisons with Human-in-the-Loop Sorting: Application in Medical Image Artifact Rating

Ranking by pairwise comparisons has shown improved reliability over ordi...
research
07/26/2012

Optimal Data Collection For Informative Rankings Expose Well-Connected Graphs

Given a graph where vertices represent alternatives and arcs represent p...
research
02/12/2018

Simultaneous Rank Tests in Analysis of Covariance Based on Pairwise Ranking

Nonparametric tests provide robust and powerful alternatives to the corr...
research
02/26/2020

Ranking a set of objects: a graph based least-square approach

We consider the problem of ranking N objects starting from a set of nois...

Please sign up or login with your details

Forgot password? Click here to reset