0


Web搜索与Query-Dependent排名的损失

Ranking with Query-Dependent Loss for Web Search
课程网址: http://videolectures.net/wsdm2010_bian_rwqd/  
主讲教师: Jiang Bian
开课单位: 微软公司
开课时间: 2010-10-12
课程语种: 英语
中文简介:
描述用户’搜索意图,因此它们在信息检索和Web搜索排名的背景下发挥着重要作用。然而,大多数现有的排名方法没有明确地考虑到查询在几个维度上显着变化并且需要关于排名模型的不同处理的事实。 在本文中,我们建议通过引入依赖于查询的损失函数将查询差异合并到排名中。在Web搜索的上下文中,查询差异通常表示为不同的查询类别;并且,查询通常根据搜索意图进行分类,例如导航,信息和事务查询。基于这种查询分类与用户对不同等级位置的结果准确性的不同期望具有高度相关性的观察,我们开发了位置敏感的查询依赖性损失函数,探索这种类型的查询分类。除了使用预定义查询分类构建排名函数的简单学习方法之外,我们还提出了一种同时学习排名函数和查询分类的新方法。 我们将查询相关的损失函数应用于两个特定的排名算法,RankNet和ListMLE。实验结果表明,可以利用查询相关的损失函数来显着提高学习的排名函数的准确性。我们还表明,与查询分类共同学习的排名函数可以实现比使用预定义查询分类所学习的更好的性能。最后,我们提供分析并进行其他实验,以更深入地了解与依赖于查询的排名方法和独立于查询的方法相比,依赖于查询的损失函数排名的优势。
课程简介: describe the users’ search intent and therefore they play an essential role in the context of ranking for information retrieval and Web search. However, most of existing approaches for ranking do not explicitly take into consideration the fact that queries vary significantly along several dimensions and entail different treatments regarding the ranking models. In this paper, we propose to incorporate query difference into ranking by introducing query-dependent loss functions. In the context of Web search, query difference is usually represented as different query categories; and, queries are usually classified according to search intent such as navigational, informational and transactional queries. Based on the observation that such kind of query categorization has high correlation with the user’s different expectation on the result accuracy on different rank positions, we develop position-sensitive query-dependent loss functions exploring such kind of query categorization. Beyond the simple learning method that builds ranking functions with predefined query categorization, we further propose a new method that learns both ranking functions and query categorization simultaneously. We apply the query dependent loss functions to two particular ranking algorithms, RankNet and ListMLE. Experimental results demonstrate that query-dependent loss functions can be exploited to significantly improve the accuracy of learned ranking functions. We also show that the ranking function jointly learned with query categorization can achieve better performance than that learned with predefined query categorization. Finally, we provide analysis and conduct additional experiments to gain deeper understanding on the advantages of ranking with query-dependent loss functions over other query-dependent ranking approaches and query-independent approaches.
关 键 词: 网络搜索; 数据挖掘; Web搜索
课程来源: 视频讲座网
最后编审: 2020-10-22:chenxin
阅读次数: 50