Approximate and dynamic rank aggregation

Authors:
Francis Y. L. Chin;Xiaotie Deng;Qizhi Fang;Shanfeng Zhu
Affiliations:
Department of Computer Science and Information Systems, The University of Hong Kong, Pokfulam Road, Hong Kong;Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, SAR;Department of Mathematics, Ocean University of China, Qingdao 266071, Shandong, P. R. China;Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, SAR
Venue:
Theoretical Computer Science - Special papers from: COCOON 2003
Year:
2004

Citing 10
Cited 5

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
Experiences with selecting search engines using metasearch

ACM Transactions on Information Systems (TOIS)
A Chernoff Bound for Random Walks on Expander Graphs

SIAM Journal on Computing
Towards a highly-scalable and effective metasearch engine

Proceedings of the 10th international conference on World Wide Web
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Approximate sequencing for variable length tasks

Theoretical Computer Science
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

Weblog success: Exploring the role of technology

International Journal of Human-Computer Studies - Human-computer interaction research in the managemant information systems discipline
Case-based multilabel ranking

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Top-d rank aggregation in web meta-search engine

FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Crossings and permutations

GD'05 Proceedings of the 13th international conference on Graph Drawing
MedRank: discovering influential medical treatments from literature by information network analysis

ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rank aggregation, originally an important issue in social choice theory, has become more and more important in information retrieval applications over the Internet, such as meta-search, recommendation system, etc. In this work, we consider an aggregation function using a weighted version of the normalized Kendall-τ distance. We propose a polynomial time approximation scheme, as well as a practical heuristic algorithm with the approximation ratio two for the NP-hard problem. In addition, we discuss issues and models for the dynamic rank aggregation problem.