Prioritizing relevance judgments to improve the construction of IR test collections

Mehdi Hosseini, Ingemar J. Cox, Natasa Milic-Frayling, Trevor Sweeting, Vishwa Vinay
2011 Proceedings of the 20th ACM international conference on Information and knowledge management - CIKM '11  
We consider the problem of optimally allocating a fixed budget to construct a test collection with associated relevance judgements, such that it can (i) accurately evaluate the relative performance of the participating systems, and (ii) generalize to new, previously unseen systems. We propose a two stage approach. For a given set of queries, we adopt the traditional pooling method and use a portion of the budget to evaluate a set of documents retrieved by the participating systems. Next, we
more » ... yze the relevance judgments to prioritize the queries and remaining pooled documents for further relevance assessments. The query prioritization is formulated as a convex optimization problem, thereby permitting efficient solution and providing a flexible framework to incorporate various constraints. Query-document pairs with the highest priority scores are evaluated using the remaining budget. We evaluate our resource optimization approach on the TREC 2004 Robust track collection. We demonstrate that our optimization techniques are cost efficient and yield a significant improvement in the reusability of the test collections.
doi:10.1145/2063576.2063671 dblp:conf/cikm/HosseiniCMSV11 fatcat:7iel3jgexjanza3kuj3clvkinq