Rank Fusion Algorithms for Metasearch Based on Voting Model
Yao Yu, Zhu Shan-feng, Xinmeng Chen · Jisuanji gongcheng · 2007
This paper studies the rank fusion problem via voting algorithms.Based on two widely discussed classical voting rules: Borda and Condorcet,some elimination voting algorithms and their variants,including Kemeny method,are analyzed in a graph theoretic approach.Because Kemeny ranking is a NP-hard problem,a new heuristic elimination voting algorithm is proposed.Some experiments are carried out on TREC data for evaluating these voting algorithms on rank fusion.Experiments show that these elimination algorithms have comparable performance with Borda algorithm,and sometimes outperform it.