rlraauc:使用用户点击的基于强化学习的排名算法

V. Derhami, J. Paksima, H. Khajeh
{"title":"rlraauc:使用用户点击的基于强化学习的排名算法","authors":"V. Derhami, J. Paksima, H. Khajeh","doi":"10.1109/ICCKE.2014.6993462","DOIUrl":null,"url":null,"abstract":"Because of great volume of web information, information retrieval process of a search engine is of great importance. For each query of user, the number of queries can reach hundred thousands, whereas a few number of the first results have the chance of being checked by user; therefore, a search engine pays attention to putting relevance results in the first ranks as a necessity. This paper introduces a reinforcement learning based ranking algorithm using user clicks, called RLRAUC, to put the relevance and favorite documents in the first ranks of query results. In the proposed algorithm, ranking system is the agent of learning system and selecting documents for displaying to user is considered as action. The reinforcement signal is calculated according to user click on documents. In this procedure, each pair of word-document in the user query is assigned a score according to the relevance of document. Documents in each repeating of learning would be sorted for next query based on changed scores and among these documents, according to document position in ranking list, random documents would be selected to be displayed to user. Learning process would be continued until it is converged to a stable ranking list. To evaluate proposed method, LETOR3 as well-known dataset has been used. Evaluation results indicate that RLRAUC is more effective than current ranking methods.","PeriodicalId":152540,"journal":{"name":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"RLRAUC: Reinforcem ent learning based ranking algorithm using user clicks\",\"authors\":\"V. Derhami, J. Paksima, H. Khajeh\",\"doi\":\"10.1109/ICCKE.2014.6993462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Because of great volume of web information, information retrieval process of a search engine is of great importance. For each query of user, the number of queries can reach hundred thousands, whereas a few number of the first results have the chance of being checked by user; therefore, a search engine pays attention to putting relevance results in the first ranks as a necessity. This paper introduces a reinforcement learning based ranking algorithm using user clicks, called RLRAUC, to put the relevance and favorite documents in the first ranks of query results. In the proposed algorithm, ranking system is the agent of learning system and selecting documents for displaying to user is considered as action. The reinforcement signal is calculated according to user click on documents. In this procedure, each pair of word-document in the user query is assigned a score according to the relevance of document. Documents in each repeating of learning would be sorted for next query based on changed scores and among these documents, according to document position in ranking list, random documents would be selected to be displayed to user. Learning process would be continued until it is converged to a stable ranking list. To evaluate proposed method, LETOR3 as well-known dataset has been used. Evaluation results indicate that RLRAUC is more effective than current ranking methods.\",\"PeriodicalId\":152540,\"journal\":{\"name\":\"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"59 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE.2014.6993462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 4th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2014.6993462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

由于网络信息量巨大,搜索引擎的信息检索过程非常重要。对于用户的每一个查询,查询的次数可以达到几十万次,而第一个结果中有少数几个有机会被用户检查;因此,搜索引擎注意将相关结果放在首位是必要的。本文介绍了一种基于强化学习的排序算法,即RLRAUC,利用用户点击量将相关和喜爱的文档放在查询结果的前几位。在该算法中,排序系统是学习系统的代理,选择显示给用户的文档作为动作。根据用户点击文件计算强化信号。在这个过程中,根据文档的相关性给用户查询中的每对word-document打分。每次重复学习中的文档将根据变化的分数进行排序,以便下一次查询,并根据文档在排名列表中的位置,在这些文档中随机选择文档显示给用户。学习过程将继续,直到它收敛到一个稳定的排名表。为了评估所提出的方法,我们使用了LETOR3作为众所周知的数据集。评价结果表明,rlraauc比现有的排序方法更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
RLRAUC: Reinforcem ent learning based ranking algorithm using user clicks
Because of great volume of web information, information retrieval process of a search engine is of great importance. For each query of user, the number of queries can reach hundred thousands, whereas a few number of the first results have the chance of being checked by user; therefore, a search engine pays attention to putting relevance results in the first ranks as a necessity. This paper introduces a reinforcement learning based ranking algorithm using user clicks, called RLRAUC, to put the relevance and favorite documents in the first ranks of query results. In the proposed algorithm, ranking system is the agent of learning system and selecting documents for displaying to user is considered as action. The reinforcement signal is calculated according to user click on documents. In this procedure, each pair of word-document in the user query is assigned a score according to the relevance of document. Documents in each repeating of learning would be sorted for next query based on changed scores and among these documents, according to document position in ranking list, random documents would be selected to be displayed to user. Learning process would be continued until it is converged to a stable ranking list. To evaluate proposed method, LETOR3 as well-known dataset has been used. Evaluation results indicate that RLRAUC is more effective than current ranking methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信