An efficient approach for the rank aggregation problem

Authors:
Liviu P. Dinu;Florin Manea
Affiliations:
Faculty of Mathematics, University of Bucharest, Academiei, Bucharest, Romania;Faculty of Mathematics, University of Bucharest, Academiei, Bucharest, Romania
Venue:
Theoretical Computer Science
Year:
2006

Citing 4
Cited 10

Topology of strings: median string is NP-complete

Theoretical Computer Science
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
On the classification and aggregation of hierarchies with different constitutive elements

Fundamenta Informaticae
On the syllabic similarities of romance languages

CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing

A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem

Fundamenta Informaticae
A Multi-Criteria Decision Method Based on Rank Distance

Fundamenta Informaticae
Total rank distance and scaled total rank distance: two alternative metrics in computational linguistics

LD '06 Proceedings of the Workshop on Linguistic Distances
Meta-search: aggregating search engine results using rank-distance

Proceedings of the Fourth International Conference on SImilarity Search and APplications
Rank distance aggregation as a fixed classifier combining rule for text categorization

CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
A note on permutations and rank aggregation

Mathematical and Computer Modelling: An International Journal
A Multi-Criteria Decision Method Based on Rank Distance

Fundamenta Informaticae
A Generalization of the Assignment Problem, and its Application to the Rank Aggregation Problem

Fundamenta Informaticae
On the closest string via rank distance

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
Clustering based on rank distance with applications on DNA

ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part V

Quantified Score

Hi-index	5.23

Visualization

Abstract

This paper presents some computational properties of the rank-distance, a measure of similarity between partial rankings. We show how this distance generalizes the Spearman footrule distance, preserving its good computational complexity: the rank-distance between two partial rankings can be computed in linear time, and the rank aggregation problem can be solved in polynomial time. Further, we present a generalization of the rank-distance to strings, which permits to solve the median string problem in polynomial time. This appears rather surprising to us given the fact that for other non-trivial string distances, such as edit-distance, this problem is NP-hard.