When two is better than one: a study of ranking paradigms and their integrations for subtopic retrieval

Leelanupab, T., Zuccon, G. and Jose, J. (2010) When two is better than one: a study of ranking paradigms and their integrations for subtopic retrieval. Lecture Notes in Computer Science, 6458, pp. 162-172. (doi: 10.1007/978-3-642-17187-1_15)

Abstract

In this paper, we consider the problem of document ranking in a non- traditional retrieval task, called subtopic retrieval. This task involves promoting relevant documents that cover many subtopics of a query at early ranks, providing thus diversity within the ranking. In the past years, several approaches have been proposed to diversify retrieval results. These approaches can be classified into two main paradigms, depending upon how the ranks of documents are revised for promoting diversity. In the first approach subtopic diversification is achieved implicitly, by choosing documents that are different from each other, while in the second approach this is done explicitly, by estimating the subtopics covered by documents. Within this context, we compare methods belonging to the two paradigms. Furthermore, we investigate possible strategies for integrating the two paradigms with the aim of formulating a new ranking method for subtopic retrieval. We conduct a number of experiments to empirically validate and contrast the state-of-the-art approaches as well as instantiations of our integration approach. The results show that the integration approach outperforms state-of-the-art strategies with respect to a number of measures.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Jose, Professor Joemon
• Authors: Leelanupab, T., Zuccon, G., and Jose, J.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• Journal Name: Lecture Notes in Computer Science
• ISSN: 0302-9743
• ISSN (Online): 1611-3349