Clustering and Inference From Pairwise Comparisons

Abstract : Given a set of pairwise comparisons, the classical ranking problem computes a single ranking that best represents the preferences of all users. In this paper, we study the problem of inferring individual preferences, arising in the context of making personalized recommendations. In particular, we assume users form clusters; users of the same cluster provide similar pairwise comparisons for the items according to the Bradley-Terry model. We propose an efficient algorithm to estimate the preference for each user: first, compute the net-win vector for each user using the comparisons; second, cluster the users based on the net-win vectors; third, estimate a single preference for each cluster separately. We show that the net-win vectors are much less noisy than the high dimensional vectors of pairwise comparisons, therefore our algorithm can cluster the users reliably. Moreover, we show that, when a cluster is only approximately correct, the maximum likelihood estimation for the Bradley-Terry model is still close to the true preference.
Document type :
Conference papers
Liste complète des métadonnées
Contributor : Laurent Massoulié <>
Submitted on : Tuesday, November 10, 2015 - 10:39:10 AM
Last modification on : Tuesday, February 5, 2019 - 2:38:01 PM

Links full text



Wu Rui, Jiaming Xu, Srikant Rayadurgam, Marc Lelarge, Laurent Massoulié, et al.. Clustering and Inference From Pairwise Comparisons. SIGMETRICS '15 Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, 2015, Portland, United States. pp.2, ⟨10.1145/2796314.2745887⟩. ⟨hal-01226785⟩



Record views