Rank Aggregation Algorithms Based on Voting Model for Metasearch

In this work, we study the rank aggregation problem based on election voting model. In addition to classical voting rules: Borda, some elimination voting algorithms, including Kemeny methods, are analyzed in a graph theoretic approach. As the Kemeny ranking problem is NP-hard, a new heuristic elimination voting algorithm is proposed in this work. Some experiments have been carried out on TREC data for evaluating these voting algorithms on rank aggregation. The experiments indicate that these elimination algorithms have comparable performance with Borda algorithms, and sometimes outperform it