Top-d rank aggregation in web meta-search engine

Authors:
Qizhi Fang;Han Xiao;Shanfeng Zhu
Affiliations:
Department of Mathematics, Ocean University of China, Qingdao, P.R. China;Department of Mathematics, Ocean University of China, Qingdao, P.R. China;School of Computer Science and Shanghai Key Lab of Intelligent Information Processing, Fudan University, Shanghai, P.R. China
Venue:
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Year:
2010

Citing 6
Cited 0

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

Combinatorica - Theory of Computing
STARTS: Stanford proposal for Internet meta-searching

SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Polynomial time approximation schemes for dense instances of NP -hard problems

Journal of Computer and System Sciences
Real life, real users, and real needs: a study and analysis of user queries on the web

Information Processing and Management: an International Journal
Rank aggregation methods for the Web

Proceedings of the 10th international conference on World Wide Web
Approximate and dynamic rank aggregation

Theoretical Computer Science - Special papers from: COCOON 2003

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the rank aggregation problem for information retrieval over Web making use of a kind of metric, the coherence, which considers both the normalized Kendall-τ distance and the size of overlap between two partial rankings. In general, the top-d coherence aggregation problem is defined as: given collection of partial rankings Π = {τ1, τ2, . . ., τK}, how to find a final ranking π with specific length d, which maximizes the total coherence Φ(π, Π) = Σi=1K Φ(π, τi). The corresponding complexity and algorithmic issues are discussed in this paper. Our main technical contribution is a polynomial time approximation scheme (PTAS) for a restricted top-d coherence aggregation problem.