Approximate rank aggregation

Authors:
Xiaotie Deng;Qizhi Fang;Shanfeng Zhu
Affiliations:
Department of Computer Science, City University of Hong Kong, Hong Kong, P. R. China;Department of Mathematics, Ocean University of Qingdao, Qingdao, Shandong, P. R. China;Department of Computer Science, City University of Hong Kong, Hong Kong, P. R. China
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 7
Cited 0

Randomized rounding: a technique for provably good algorithms and algorithmic proofs

Combinatorica - Theory of Computing
Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
New results on the computation of median orders

Proceedings of an international symposium on Graphs and combinatorics
A Chernoff Bound for Random Walks on Expander Graphs

SIAM Journal on Computing
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider algorithmic issues of the rank aggregation problem for information retrieval on the Web. We introduce a weighted version of the metric of the normalized Kendall-τ distance, originally proposed for the problem by Dwork, et al.,[7] and show that it satisfies the extended Condorcet criterion. Our main technical contribution is a polynomial time approximation scheme, in addition to a practical heuristic algorithm with ratio 2 for the NP-hard problem.