Voting Model Based Rank Fusion Algorithms for Metasearch
The rank fusion problem for metasearch engines was studied based on voting model in this work. In addition to two widely discussed classical voting rules: Borda and Condorcet, some elimination voting algorithms and their variants, including Kemeny and Nanson methods, were analyzed through a graph theoretic approach. As Kemeny ranking problem was NP-hard complexity, a new heuristic elimination voting algorithm was proposed. Some experiments were carried out on TREC data for evaluating these voting algorithms on rank fusion. The experiments indicate that these elimination algorithms have comparable performance with Borda algorithms, and sometimes outperform it.
Rank Fusion Elimination Voting Voting Model Metasearch Information Retrieval
Yao Yu Zhu Shanfeng Chen Gang Chen Xinmeng
Computer School, Wuhan University, Wuhan Hubei 430072, China Institute for Chemical Research, Kyoto University, Uji Kyoto 611-0011, Japan
国际会议
杭州
英文
658-662
2006-10-12（万方平台首次上网日期，不代表论文的发表时间）