首页> 外文期刊>Information retrieval >Fewer topics? A million topics? Both?! On topics subsets in test collections
【24h】

Fewer topics? A million topics? Both?! On topics subsets in test collections

机译:更少的主题?一百万个主题?两个都?!关于测试集合中的主题子集

获取原文
获取原文并翻译 | 示例
           

摘要

When evaluating IR run effectiveness using a test collection, a key question is: What search topics should be used? We explore what happens to measurement accuracy when the number of topics in a test collection is reduced, using the Million Query 2007, TeraByte 2006, and Robust 2004 TREC collections, which all feature more than 50 topics, something that has not been examined in past work. Our analysis finds that a subset of topics can be found that is as accurate as the full topic set at ranking runs. Further, we show that the size of the subset, relative to the full topic set, can be substantially smaller than was shown in past work. We also study the topic subsets in the context of the power of statistical significance tests. We find that there is a trade off with using such sets in that significant results may be missed, but the loss of statistical significance is much smaller than when selecting random subsets. We also find topic subsets that can result in a low accuracy test collection, even when the number of queries in the subset is quite large. These negatively correlated subsets suggest we still lack good methodologies which provide stability guarantees on topic selection in new collections. Finally, we examine whether clustering of topics is an appropriate strategy to find and characterize good topic subsets. Our results contribute to the understanding of information retrieval effectiveness evaluation, and offer insights for the construction of test collections.
机译:使用测试集评估IR运行效率时,一个关键问题是:应该使用哪些搜索主题?我们探讨测量准确性的测量准确性,当测试收集中的主题数量减少,使用百万查询2007,Terabyte 2006和强大的2004年TREC集合,所有功能都有超过50个主题,这些主题在过去尚未检查的东西工作。我们的分析发现,可以找到主题的子集,这与排名运行中的全部主题一样准确。此外,我们表明,相对于全主题集的子集的大小可以大大小于过去的工作中所示。我们还在统计显着性测试的力量上研究了主题子集。我们发现使用这样的集合有一个折衷,因为可能会错过显着的结果,但统计显着性的损失远小于选择随机子集时。我们还发现主题子集可以导致低精度测试集合,即使子集查询的数量相当大。这些负相关的子集表明,我们仍然缺乏良好的方法,这些方法提供了在新集合中选择主题选择的稳定性保证。最后,我们检查主题的聚类是一个适当的策略,用于查找和表征好主题子集。我们的成果有助于了解信息检索效率评估,并为建设测试收集提供见解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号