Rank aggregation for meta-search engines

Authors:
Ka Wai Lam;Chi Ho Leung
Affiliations:
Chinese University of Hong Kong, Shatin, Hong Kong;Chinese University of Hong Kong, Shatin, Hong Kong
Venue:
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Year:
2004

Citing 3
Cited 3

A new algorithm for ranking players of a round-robin tournament

Computers and Operations Research
Learning to order things

NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
Models for metasearch

Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval

Supervised rank aggregation

Proceedings of the 16th international conference on World Wide Web
Semi-supervised ranking aggregation

Information Processing and Management: an International Journal
Solving election manipulation using integer partitioning problems

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm for merging results from different data sources in meta-search engine. We further extend one that has developed for ranking players of a round-robin tournament to a more general one when the ranking input is given from multiple sources. The problem in meta-search engine can be represented by a complete directed graph which can be used by the Majority Spanning Tree (MST) algorithm. It is useful especially when the system must integrate and merge the query results that are returned from various search engines in a consistent manner.