...
首页> 外文期刊>Journal of information and computational science >Learning to Rank for Information Retrieval Using the Clonal Selection Algorithm*
【24h】

Learning to Rank for Information Retrieval Using the Clonal Selection Algorithm*

机译:使用克隆选择算法学习信息检索的排名*

获取原文
获取原文并翻译 | 示例

摘要

One central problem of Information Retrieval (IR) is ranking. This paper focuses on learning to rank for IR, which exploits machine learning to handle the ranking task. One state of the art approach for learning to rank is the listwise one, which uses document lists as "instance" in learning, and minimizes a loss function defined on the predicted permutation and the ground-truth permutation. In this paper we propose a novel listwise method, ListClonal, to address learning to rank for IR. ListClonal employs the clonal selection algorithm to learn an effective ranking function by combining various types of evidences in IR. A weighted rank measure of correlation called Shieh/b is introduced as the listwise loss function to precisely measure the rank performance for learning. Experimental results on the LETOR benchmark datasets show that ListClonal outperforms the baseline methods of BM25, LMIR, Ranking SVM, and AdaRank in terms of Kendall tau, Spearman's and Shieh/b rank correlation.
机译:信息检索(IR)的一个中心问题是排名。本文着重于学习针对IR的排名,它利用机器学习来处理排名任务。用于学习排名的一种最先进的方法是按列表排列的方法,该方法将文档列表用作学习中的“实例”,并最大程度地减少了根据预测排列和真实的排列定义的损失函数。在本文中,我们提出了一种新颖的基于列表的方法ListClonal,用于解决针对IR进行排名的问题。 ListClonal使用克隆选择算法,通过结合IR中的各种类型的证据来学习有效的排名功能。引入了称为Shieh / b的相关性加权秩度量作为基于列表的损失函数,以精确度量学习的秩性能。在LETOR基准数据集上的实验结果表明,就Kendall tau,Spearman's和Shieh / b排名相关性而言,ListClonal优于BM25,LMIR,SVM排名和AdaRank的基线方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号