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 \(\Phi(\pi,\Pi)=\sum_{i=1}^K \Phi(\pi,\tau_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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arora, S., Frieze, A., Kaplan, H.: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming, Ser. A 92, 1–36 (2002)
Arora, S., Karger, D., Karpinski, M.: Polynomial-time approximation schemes for dense instances of NP-hard optimization problems. Journal of Computer and System Sciences 58, 193–210 (1999)
Barthelemy, J.P., Guenoche, A., Hudry, O.: Median linear orders: Heuristics and a branch and bound algorithm. European Journal of Operational Research 42, 313–325 (1989)
Chin, F.Y.L., Deng, X., Fang, Q., Zhu, S.: Approximate and dynamic rank aggregation. Theoretical Computer Science 352, 409–424 (2004)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. WWW10, pp. 613–622 (2001)
Gravano, L., Chang, C., Garcia-Molina, H., Paepcke, A.: STARTS: Stanford proposal for internet meta-searching. ACM SIGMOD, Tucson, 207–218 (May 1997)
Hoelscher, C.: How Internet Experts Search for Information on the Web. In: The World Conference of the World Wide Web, Internet, and Intranet, Orlando, FL (1998)
Jansen, B.J., Spink, A., Saracevic, T.: Real life, real users, and real needs: a study and analysis of user queries on the web. Information Processing and Management 36, 207–227 (2000)
Raghavan, P., Thompson, C.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7, 365–374 (1987)
Silverstein, C., Henzinger, M., Marais, H., Moricz, M.: Analysis of a very large altavista query log. Technical Report SRC 1998-014, Digital Systems Research Center (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fang, Q., Xiao, H., Zhu, S. (2010). Top-d Rank Aggregation in Web Meta-search Engine. In: Lee, DT., Chen, D.Z., Ying, S. (eds) Frontiers in Algorithmics. FAW 2010. Lecture Notes in Computer Science, vol 6213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14553-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-14553-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14552-0
Online ISBN: 978-3-642-14553-7
eBook Packages: Computer ScienceComputer Science (R0)