Rank aggregation with ties: Experiments and Analysis

Abstract : The problem of aggregating multiple rankings into one consensus ranking is an active research topic especially in the database community. Various studies have implemented methods for rank aggregation and may have come up with contradicting conclusions upon which algorithms work best. Comparing such results is cumbersome, as the original studies mixed di erent approaches and used very di erent evaluation datasets and metrics. Additionally, in real applications, the rankings to be aggregated may not be permutations where elements are strictly ordered, but they may have ties where some elements are placed at the same position. However, most of the studies have not considered ties. This paper introduces the rst large scale study of algorithms for rank aggregation with ties. More precisely, (i) we review rank aggregation algorithms and determine whether or not they can handle ties; (ii) we propose the first implementation to compute the exact solution of the Rank Aggregation with ties problem; (iii) we evaluate algorithms for rank aggregation with ties on a very large panel of both real and carefully generated synthetic datasets; (iv) we provide guidance on the algorithms to be favored depending on dataset features.
Type de document :
Article dans une revue
Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2015, pp.2051
Liste complète des métadonnées

Contributeur : Sarah Cohen-Boulakia <>
Soumis le : dimanche 5 juillet 2015 - 22:32:20
Dernière modification le : samedi 18 février 2017 - 01:19:10


Fichiers éditeurs autorisés sur une archive ouverte


  • HAL Id : hal-01165336, version 1


Bryan Brancotte, Bo Yang, Guillaume Blin, Sarah Cohen-Boulakia, Alain Denise, et al.. Rank aggregation with ties: Experiments and Analysis. Proceedings of the VLDB Endowment (PVLDB), VLDB Endowment, 2015, pp.2051. <hal-01165336>



Consultations de
la notice


Téléchargements du document