Rank Aggregation Performance Analysis for Borda and Local Search Algorithm

  • Liu Yong, Wang Zulin
  • Published 2010 in
    2010 Third International Symposium on Information…

Abstract

This paper presents a novel theoretical analysis for Borda's algorithm and local search algorithm for rank aggregation, which is a heated topic in the field of search technology nowadays and is also known as a NP-hard problem. In contrast to the previous known approximation ratio of Borda's algorithm, which is 5, we show in this paper that Borda's algorithm… (More)

4 Figures and Tables

Topics

  • Presentations referencing similar topics