Applying layered multi-population genetic programming on learning to rank for information retrieval

J. Lin, Jen-Yuan Yeh, Chao-Chung Liu
{"title":"Applying layered multi-population genetic programming on learning to rank for information retrieval","authors":"J. Lin, Jen-Yuan Yeh, Chao-Chung Liu","doi":"10.1109/ICMLC.2012.6359640","DOIUrl":null,"url":null,"abstract":"Information retrieval (IR) returns a relative ranking of documents with respect to a user query. Learning to rank for information retrieval (LR4IR) employs supervised learning techniques to address this problem, and it aims to produce a ranking model automatically for defining a proper sequential order of related documents based on the query. The ranking model determines the relationship degree between documents and the query. In this paper an improved version of RankGP is proposed. It uses layered multi-population genetic programming to obtain a ranking function which consists of a set of IR evidences and particular predefined operators. The proposed method is capable to generate complex functions through evolving small populations. In this paper, LETOR 4.0 was used to evaluate the effectiveness of the proposed method and the results showed that the method is competitive with other LR4IR Algorithms.","PeriodicalId":128006,"journal":{"name":"2012 International Conference on Machine Learning and Cybernetics","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Machine Learning and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMLC.2012.6359640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Information retrieval (IR) returns a relative ranking of documents with respect to a user query. Learning to rank for information retrieval (LR4IR) employs supervised learning techniques to address this problem, and it aims to produce a ranking model automatically for defining a proper sequential order of related documents based on the query. The ranking model determines the relationship degree between documents and the query. In this paper an improved version of RankGP is proposed. It uses layered multi-population genetic programming to obtain a ranking function which consists of a set of IR evidences and particular predefined operators. The proposed method is capable to generate complex functions through evolving small populations. In this paper, LETOR 4.0 was used to evaluate the effectiveness of the proposed method and the results showed that the method is competitive with other LR4IR Algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
将分层多种群遗传规划应用于信息检索排序学习
信息检索(Information retrieval, IR)返回文档相对于用户查询的相对排名。信息检索排序学习(LR4IR)采用监督学习技术来解决这个问题,它的目标是生成一个排序模型,用于根据查询自动定义相关文档的适当顺序。排序模型确定文档与查询之间的关系程度。本文提出了RankGP的改进版本。该算法采用分层多种群遗传规划方法,得到由一组红外证据和特定的预定义算子组成的排序函数。该方法能够通过进化小种群生成复杂的函数。本文使用LETOR 4.0对该方法的有效性进行了评估,结果表明该方法与其他LR4IR算法具有一定的竞争力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
ROBUST H∞ filtering for a class of nonlinear uncertain singular systems with time-varying delay Discriminati on between external short circuit and internal winding fault in power transformer using discrete wavelet transform and back-propagation neural network Hybrid linear and nonlinear weight Particle Swarm Optimization algorithm Transcriptional cooperativity in molecular dynamics based on normal mode analysis An efficient web document clustering algorithm for building dynamic similarity profile in Similarity-aware web caching
×
引用
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