AdaGP-Rank:将提升技术应用于遗传规划学习排序

Feng Wang, Xin Xu
{"title":"AdaGP-Rank:将提升技术应用于遗传规划学习排序","authors":"Feng Wang, Xin Xu","doi":"10.1109/YCICT.2010.5713094","DOIUrl":null,"url":null,"abstract":"One crucial task of learning to rank in the field of information retrieval (IR) is to determine an ordering of documents according to their degree of relevance to the user given query. In this paper, a learning method is proposed named AdaGP-Rank by applying boosting techniques to genetic programming. This approach uses genetic programming to evolve ranking functions while a process inspired from AdaBoost technique helps the evolved ranking functions concentrate on the ranking of those documents associating those ‘hard’ queries. Based on the confidence coefficients, the ranking functions obtained at each boosting round are then combined into a final strong ranker. Experiments conform that AdaGP-Rank has general better performance than several state-of-the-art ranking algorithms on the benchmark data sets.","PeriodicalId":179847,"journal":{"name":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"AdaGP-Rank: Applying boosting technique to genetic programming for learning to rank\",\"authors\":\"Feng Wang, Xin Xu\",\"doi\":\"10.1109/YCICT.2010.5713094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"One crucial task of learning to rank in the field of information retrieval (IR) is to determine an ordering of documents according to their degree of relevance to the user given query. In this paper, a learning method is proposed named AdaGP-Rank by applying boosting techniques to genetic programming. This approach uses genetic programming to evolve ranking functions while a process inspired from AdaBoost technique helps the evolved ranking functions concentrate on the ranking of those documents associating those ‘hard’ queries. Based on the confidence coefficients, the ranking functions obtained at each boosting round are then combined into a final strong ranker. Experiments conform that AdaGP-Rank has general better performance than several state-of-the-art ranking algorithms on the benchmark data sets.\",\"PeriodicalId\":179847,\"journal\":{\"name\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Youth Conference on Information, Computing and Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/YCICT.2010.5713094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Youth Conference on Information, Computing and Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/YCICT.2010.5713094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在信息检索(IR)领域中,学习排序的一个关键任务是根据文档与用户给定查询的相关程度确定文档的排序。本文提出了一种将增强技术应用于遗传规划的学习方法AdaGP-Rank。这种方法使用遗传编程来进化排名函数,而受AdaBoost技术启发的过程有助于进化的排名函数专注于那些与“硬”查询相关的文档的排名。基于置信度系数,将每一轮提升得到的排名函数组合成最终的强排名。实验表明,在基准数据集上,AdaGP-Rank总体上优于几种最先进的排名算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
AdaGP-Rank: Applying boosting technique to genetic programming for learning to rank
One crucial task of learning to rank in the field of information retrieval (IR) is to determine an ordering of documents according to their degree of relevance to the user given query. In this paper, a learning method is proposed named AdaGP-Rank by applying boosting techniques to genetic programming. This approach uses genetic programming to evolve ranking functions while a process inspired from AdaBoost technique helps the evolved ranking functions concentrate on the ranking of those documents associating those ‘hard’ queries. Based on the confidence coefficients, the ranking functions obtained at each boosting round are then combined into a final strong ranker. Experiments conform that AdaGP-Rank has general better performance than several state-of-the-art ranking algorithms on the benchmark data sets.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Dynamic channel allocation based on genetic algorith in TD-SCDMA system A distributed coding protocol for wireless relay networks A differential evolution optimized fuzzy clustering algorithm with adaptive adjusting strategy Optimization of water allocation based on the economic loss analysis under different drought scenarios City traffic flow character analysis and origin-destination estimation based on data mining
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1