【24h】

Predicting Query Performance on the Web

机译:预测Web上的查询性能

获取原文

摘要

Predicting the performance of web queries is useful for several applications such as automatic query reformulation and automatic spell correction. In the web environment, accurate performance prediction is challenging because measures such as clarity that work well on homogeneous TREC-like collections, are not as effective and are often expensive to compute. We present Rank-time Performance Prediction (RAPP), an effective and efficient approach for online performance prediction on the web. RAPP uses retrieval scores, and aggregates of the rank-time features used by the document-ranking algorithm to train regressors for query performance prediction. On a set of over 12,000 queries sampled from the query logs of a major search engine, RAPP achieves a linear correlation of 0.78 with DCG@5, and 0.52 with NDCG@5. Analysis of prediction accuracy shows that hard queries are easier to identify while easy queries are harder to identify.
机译:预测Web查询的性能对于诸如自动查询重构和自动拼写校正之类的若干应用是有用的。在Web环境中,准确的性能预测是具有挑战性的,因为诸如清晰度的诸如均匀的TREC的集合中的措施,并且往往是昂贵的计算。我们呈现秩序序列性能预测(RAPP),对网上的在线性能预测有效和有效的方法。 RAPP使用检索分数,并由文档排名算法使用的秩序特征的聚合来训练查询性能预测的回归。在从主要搜索引擎的查询日志中采样的一组超过12,000个查询中,RAPP使用DCG @ 5和0.52实现了0.78的线性相关性,其中NDCG @ 5。预测精度分析表明,难以识别的难以识别更容易识别。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号