Preference relations based unsupervised rank aggregation for metasearch

Desarkar, Maunendra Sankar and Sarkar, S and Mitra, P (2016) Preference relations based unsupervised rank aggregation for metasearch. Expert Systems with Applications, 49. pp. 86-98. ISSN 0957-4174

Text (Author versoin post-print)
2090_ESWA_Author_Copy.pdf - Accepted Version

Download (305kB) | Preview


Rank aggregation mechanisms have been used in solving problems from various domains such as bioinformatics, natural language processing, information retrieval, etc. Metasearch is one such application where a user gives a query to the metasearch engine, and the metasearch engine forwards the query to multiple individual search engines. Results or rankings returned by these individual search engines are combined using rank aggregation algorithms to produce the final result to be displayed to the user. We identify few aspects that should be kept in mind for designing any rank aggregation algorithms for metasearch. For example, generally equal importance is given to the input rankings while performing the aggregation. However, depending on the indexed set of web pages, features considered for ranking, ranking functions used etc. by the individual search engines, the individual rankings may be of different qualities. So, the aggregation algorithm should give more weight to the better rankings while giving less weight to others. Also, since the aggregation is performed when the user is waiting for response, the operations performed in the algorithm need to be light weight. Moreover, getting supervised data for rank aggregation problem is often difficult. In this paper, we present an unsupervised rank aggregation algorithm that is suitable for metasearch and addresses the aspects mentioned above. We also perform detailed experimental evaluation of the proposed algorithm on four different benchmark datasets having ground truth information. Apart from the unsupervised Kendall-Tau distance measure, several supervised evaluation measures are used for performance comparison. Experimental results demonstrate the efficacy of the proposed algorithm over baseline methods in terms of supervised evaluation metrics. Through these experiments we also show that Kendall-Tau distance metric may not be suitable for evaluating rank aggregation algorithms for metasearch.

[error in script]
IITH Creators:
IITH CreatorsORCiD
Desarkar, Maunendra SankarUNSPECIFIED
Item Type: Article
Uncontrolled Keywords: Rank aggregation; Metasearch; Information retrieval
Subjects: Computer science > Big Data Analytics
Divisions: Department of Computer Science & Engineering
Depositing User: Team Library
Date Deposited: 28 Dec 2015 05:05
Last Modified: 01 Sep 2017 11:29
Publisher URL:
OA policy:
Related URLs:

Actions (login required)

View Item View Item
Statistics for RAIITH ePrint 2090 Statistics for this ePrint Item