Query polyrepresentation for ranking retrieval systems without relevance judgments

  • Authors:
  • Miles Efron;Megan Winget

  • Affiliations:
  • Graduate School of Library and Information Science, University of Illinois, 501 E. Daniel St., Champaign, IL, 61820;School of Information, University of Texas, 1 University Station D7000, Austin, TX 78712

  • Venue:
  • Journal of the American Society for Information Science and Technology
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ranking information retrieval (IR) systems with respect to their effectiveness is a crucial operation during IR evaluation, as well as during data fusion. This article offers a novel method of approaching the system-ranking problem, based on the widely studied idea of polyrepresentation. The principle of polyrepresentation suggests that a single information need can be represented by many query articulations–what we call query aspects. By skimming the top k (where k is small) documents retrieved by a single system for multiple query aspects, we collect a set of documents that are likely to be relevant to a given test topic. Labeling these skimmed documents as putatively relevant lets us build pseudorelevance judgments without undue human intervention. We report experiments where using these pseudorelevance judgments delivers a rank ordering of IR systems that correlates highly with rankings based on human relevance judgments. © 2010 Wiley Periodicals, Inc.