Computing distances between partial rankings

Authors:
Mukul S. Bansal;David Fernández-Baca
Affiliations:
Department of Computer Science, Iowa State University, Ames, IA 50011, USA;Department of Computer Science, Iowa State University, Ames, IA 50011, USA
Venue:
Information Processing Letters
Year:
2009

Citing 6
Cited 2

Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Optimal Algorithms for List Indexing and Subset Rank

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Comparing Top k Lists

SIAM Journal on Discrete Mathematics
Algorithm Design

Algorithm Design
Comparing Partial Rankings

SIAM Journal on Discrete Mathematics
Aggregation of partial rankings, p-ratings and top-m lists

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

Kantorovich distances between rankings with applications to rank aggregation

ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part I
Ranking forests

The Journal of Machine Learning Research

Quantified Score

Hi-index	0.89

Visualization

Abstract

We give two efficient algorithms for computing distances between partial rankings (i.e. rankings with ties). Given two partial rankings over n elements, and with b and c equivalence classes, respectively, our first algorithm runs in O(nlogn/loglogn) time, and the second in O(nlogmin{b,c}) time.