Query Polyrepresentation for Ranking Retrieval Systems Without Relevance Judgments

摘要

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 pseudorel-evance judgments without undue human intervention. We report experiments where using these pseudorele-vance judgments delivers a rank ordering of IR systems that correlates highly with rankings based on human relevance judgments.