首页> 外文会议>European Conference on IR Research >Predicting the Size of Candidate Document Set for Implicit Web Search Result Diversification
【24h】

Predicting the Size of Candidate Document Set for Implicit Web Search Result Diversification

机译:预测隐式Web搜索结果多样化的候选文档集的大小

获取原文

摘要

Implicit result diversification methods exploit the content of the documents in the candidate set, i.e., the initial retrieval results of a query, to obtain a relevant and diverse ranking. As our first contribution, we explore whether recently introduced word embeddings can be exploited for representing documents to improve diversification, and show a positive result. As a second improvement, we propose to automatically predict the size of candidate set on per query basis. Experimental evaluations using our BM25 runs as well as the best-performing ad hoc runs submitted to TREC (2009-2012) show that our approach improves the performance of implicit diversification up to 5.4% wrt. initial ranking.
机译:隐式结果多样化方法利用候选集中文档的内容,即查询的初始检索结果,以获得相关且多样化的排名。作为我们的第一项贡献,我们探索了是否可以利用最近引入的词嵌入来表示文档以提高多样性,并显示出积极的结果。作为第二个改进,我们建议根据每个查询自动预测候选集的大小。使用我们的BM25运行以及提交给TREC的最佳性能临时运行(2009-2012)进行的实验评估表明,我们的方法将隐式分散的性能提高了5.4%wrt。初始排名。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号