Revisiting Sub–topic Retrieval in the ImageCLEF 2009 Photo Retrieval Task

  • Leelanupab T
  • Zuccon G
  • Jose J
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ranking documents according to the Probability Ranking Principle has been theoretically shown to guarantee optimal retrieval effectiveness in tasks such as ad hoc document retrieval. This ranking strategy assumes independence among document relevance assessments. This assumption, however, often does not hold, for example in the scenarios where redundancy in retrieved documents is of major concern, as it is the case in the sub-topic retrieval task. In this chapter, we propose a new ranking strategy for sub-topic retrieval that builds upon the interdependent document relevance and topic-oriented models. With respect to the topic-oriented model, we investigate both static and dynamic clustering techniques, aiming to group topically similar documents. Evidence from clusters is then combined with information about document dependencies to form a new document ranking. We compare and contrast the proposed method against state-of-the-art approaches, such as Maximal Marginal Relevance, Portfolio Theory for Information Retrieval, and standard cluster-based diversification strategies. The empirical investigation is performed on the ImageCLEF 2009 Photo Retrieval collection, where images are assessed with respect to sub-topics of a more general query topic. The experimental results show that our approaches outperform the state-of-the-art strategies with respect to a number of diversity measures.

Cite

CITATION STYLE

APA

Leelanupab, T., Zuccon, G., & Jose, J. M. (2010). Revisiting Sub–topic Retrieval in the ImageCLEF 2009 Photo Retrieval Task (pp. 277–294). https://doi.org/10.1007/978-3-642-15181-1_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free