Active Ranking from Pairwise Comparisons with Dynamically Arriving Items and Voters
2020pp. 229–233
Citations Over Time
Abstract
We initiate the study of ranking from pairwise comparisons where the items to be ranked and (potentially malicious/random) voters who provide comparisons appear dynamically over time. We present DARPC-TOP, a general algorithmic framework for this problem. A detailed experimental study on simulated datasets under the standard Bradley-Terry-Luce assumption for generating comparisons reveals that DARPC-TOP adapts very well to various distributions of voter and item arrivals. Furthermore, DARPC-TOP also is able to focus on ranking items well at the top of the list thus achieving the dual goal of ranking well at the top while adapting to item and voter arrivals.
Related Papers
- → Fair pairwise learning to rank(2020)8 cited
- → Multimedia information retrieval based on pairwise comparison and its application to visual search(2011)6 cited
- → Learning To Rank Relevant Documents for Information Retrieval in Bioengineering Text Corpora(2021)2 cited
- → New Challenges for Cross-Language Information Retrieval: Multimedia Data and the User Experience(2001)3 cited
- → Evaluating Artificial Systems for Pairwise Ranking Tasks Sensitive to Individual Differences(2019)