首页> 外文会议>ACM conference on information and knowledge management >Directly Optimizing Evaluation Measures in Learning to Rank Based on the Clonal Selection Algorithm
【24h】

Directly Optimizing Evaluation Measures in Learning to Rank Based on the Clonal Selection Algorithm

机译:基于克隆选择算法直接优化学习评估措施

获取原文

摘要

One fundamental issue of learning to rank is the choice of loss function to be optimized. Although the evaluation measures used in Information Retrieval (IR) are ideal ones, in many cases they can't be used directly because they do not satisfy the smooth property needed in conventional machine learning algorithms. In this paper a new method named RankCSA is proposed, which tries to use IR evaluation measure directly. It employs the clonal selection algorithm to learn an effective ranking function by combining various evidences in IR. Experimental results on the LETOR benchmark datasets demonstrate that RankCSA outperforms the baseline methods in terms of P@n, MAP and NDCG@n.
机译:学习排名的一个基本问题是优化损失函数的选择。尽管信息检索(IR)中使用的评估措施是理想的,但在许多情况下,它们不能直接使用,因为它们不满足传统机器学习算法所需的平滑性。在本文中,提出了一种名为RankCSA的新方法,这试图直接使用IR评估措施。它采用克隆选择算法通过组合IR中的各种证据来学习有效的排名功能。 LETOR基准数据集上的实验结果表明,RankCSA在P @ N,MAP和NDCG @ n方面表现出基线方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号