Loading...

Revisiting optimal rank aggregation: A dynamic programming approach

Tabrizi, S. A ; Sharif University of Technology | 2015

557 Viewed
  1. Type of Document: Article
  2. DOI: 10.1145/2808194.2809490
  3. Publisher: Association for Computing Machinery, Inc , 2015
  4. Abstract:
  5. Rank aggregation, that is merging multiple ranked lists, is a pivotal challenge in many information retrieval (IR) systems, especially in distributed IR and multilingual IR. From the evaluation point of view, being able to calculate the upper-bound of performance of the final aggregated list lays the ground for evaluating different aggregation strategies, independently. In this paper, we propose an algorithm based on dynamic programming which, using relevancy information, obtains the aggregated list with the maximum performance that could be possibly achieved by any aggregation strategy. We also provide a detailed proof for the optimality of the result of the algorithm. Furthermore, we demonstrate that the previous proposed algorithm fails to reach the optimal result in many circumstances, due to its greedy essence
  6. Keywords:
  7. Evaluation ; Information retrieval ; Rank aggregation ; Aggregates ; Information retrieval ; Search engines ; Aggregation strategy ; Evaluation ; Optimal results ; Optimality ; Rank aggregation ; Upper Bound ; Dynamic programming
  8. Source: ICTIR 2015 - Proceedings of the 2015 ACM SIGIR International Conference on the Theory of Information Retrieval, 27 September 2015 through 30 September 2015 ; 2015 , Pages 353-356 ; 9781450338332 (ISBN)
  9. URL: http://dl.acm.org/citation.cfm?doid=2808194.2809490