Learning shared rankings from mixtures of noisy pairwise comparisons
Lists
Only you see this
Abstract
We propose a novel model for rank aggregation from pairwise comparisons which accounts for a heterogeneous population of inconsistent users whose preferences are different mixtures of multiple shared ranking schemes. By connecting this problem to recent advances in the non-negative matrix factorization (NMF) literature, we develop an algorithm that can learn the underlying shared rankings with provable statistical and computational efficiency guarantees. We validate the approach using semi-synthetic and real world datasets.
BibTeX
@inproceedings{ding2015learning,
author = {Weicong Ding and Prakash Ishwar and Venkatesh Saligrama},
title = {{Learning shared rankings from mixtures of noisy pairwise comparisons}},
booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
year = {2015},
url = {https://openreview.net/forum?id=hohMvQg1k7},
}Loading related content...