首页> 外文会议>Advances in information retrieval. >Score Transformation in Linear Combination for Multi-criteria Relevance Ranking
【24h】

Score Transformation in Linear Combination for Multi-criteria Relevance Ranking

机译:线性组合中的得分转换,用于多准则相关性排名

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

摘要

In many Information Retrieval (IR) tasks, documents should be ranked based on a combination of multiple criteria. Therefore, we would need to score a document in each criterion aspect of relevance and then combine the criteria scores to generate a final score for each document. Linear combination of these aspect scores has so far been the dominant approach due to its simplicity and effectiveness. However, such a strategy of combination requires that the scores to be combined are "comparable" to each other, an assumption that generally does not hold due to the different ways of scoring each criterion. Thus it is necessary to transform the raw scores for different criteria appropriately to make them more comparable before combination. In this paper we propose a new principled approach to score transformation in linear combination, in which we would learn a separate non-linear transformation function for each relevance criterion based on the Alternating Conditional Expectation (ACE) algorithm and BoxCox Transformation. Experimental results show that the proposed method is effective and is also robust against non-linear perturbations of the original scores.
机译:在许多信息检索(IR)任务中,应基于多个条件的组合对文档进行排名。因此,我们需要在相关性的每个标准方面对文档进行评分,然后将这些标准评分结合起来以为每个文档生成最终评分。这些方面分数的线性组合由于其简单性和有效性而成为主流方法。但是,这种组合策略要求要组合的分数彼此“可比较”,这种假设由于对每个标准评分的方式不同而通常不成立。因此,有必要适当地转换不同标准的原始分数,以使它们在组合之前更具可比性。在本文中,我们提出了一种新的原则上的线性组合分数转换方法,其中我们将基于交替条件期望(ACE)算法和BoxCox转换为每个相关性准则学习一个单独的非线性转换函数。实验结果表明,所提出的方法是有效的,并且对于原始分数的非线性扰动也是鲁棒的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号