【24h】

Query Expansion with the Minimum Relevance Judgments

机译:具有最小相关性判断的查询扩展

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

摘要

Query expansion techniques generally select new query terms from a set of top ranked documents. Although a user's manual judgment of those documents would much help to select good expansion terms, it is difficult to get enough feedback from users in practical situations. In this paper we propose a query expansion technique which performs well even if a user notifies just a relevant document and a non-relevant document. In order to tackle this specific condition, we introduce two refinements to a well-known query expansion technique. One is to increase documents possibly being relevant by a transductive learning method because the more relevant documents will produce the better performance. The other is a modified term scoring scheme based on the results of the learning method and a simple function. Experimental results show that our technique outperforms some traditional methods in standard precision and recall criteria.
机译:查询扩展技术通常从一组排名最高的文档中选择新的查询词。尽管用户手动判断这些文档将有助于选择良好的扩展术语,但是在实际情况下很难从用户那里获得足够的反馈。在本文中,我们提出了一种查询扩展技术,该技术即使用户仅通知相关文档和不相关文档也能很好地执行。为了解决此特定条件,我们对众所周知的查询扩展技术进行了两种改进。一种是通过跨语言学习方法增加可能相关的文档,因为相关性更高的文档将产生更好的性能。另一个是基于学习方法和简单函数的结果的改进术语评分方案。实验结果表明,我们的技术在标准精度和召回标准上优于传统方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号