0


网络搜索中的新旧程度排名

Towards Recency Ranking in Web Search
课程网址: http://videolectures.net/wsdm2010_dong_trr/  
主讲教师: Anlei Dong
开课单位: 雅虎硅谷研究院
开课时间: 2010-02-22
课程语种: 英语
中文简介:
在网络搜索中,近因排序是指根据相关度对文档进行排序,并将新鲜度考虑在内。本文提出了一种自动检测和响应近因敏感查询的检索系统。系统使用高精度分类器检测对近因敏感的查询。系统通过使用为此类查询培训的机器学习的排名模型来响应对近因敏感的查询。我们使用多个近因特征来提供有效表示文档近因的时间证据。此外,我们还提出了一些培训方法,这些方法对于培训对近况敏感的咆哮者很重要。最后,我们为对近因敏感的查询开发了新的评估指标。我们的实验证明了这些方法的有效性。
课程简介: In web search, recency ranking refers to ranking documents by relevance which takes freshness into account. In this paper, we propose a retrieval system which automatically detects and responds to recency sensitive queries. The system detects recency sensitive queries using a high precision classifier. The system responds to recency sensitive queries by using a machine learned ranking model trained for such queries. We use multiple recency features to provide temporal evidence which effectively represents document recency. Furthermore, we propose several training methodologies important for training recency sensitive rankers. Finally, we develop new evaluation metrics for recency sensitive queries. Our experiments demonstrate the efficacy of the proposed approaches.
关 键 词: 检索系统; 新旧程度敏感查询; 机器学习
课程来源: 视频讲座网
最后编审: 2019-11-11:lxf
阅读次数: 46