Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Condorcet fusion for improved retrieval
Proceedings of the eleventh international conference on Information and knowledge management
Cranking: Combining Rankings Using Conditional Probability Models on Permutations
ICML '02 Proceedings of the Nineteenth International Conference on Machine Learning
SIAM Journal on Discrete Mathematics
Web metasearch: rank vs. score based rank aggregation methods
Proceedings of the 2003 ACM symposium on Applied computing
SIAM Journal on Discrete Mathematics
Determining possible and necessary winners under common voting rules given partial orders
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms
Towards a dichotomy for the Possible Winner problem in elections based on scoring rules
Journal of Computer and System Sciences
The nearest neighbor spearman footrule distance for bucket, interval, and partial orders
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences
Comparing and aggregating partial orders with kendall tau distances
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Hi-index | 0.00 |
Comparing and ranking information is an important topic in social and information sciences, and in particular on the web. Its objective is to measure the difference of the preferences of voters on a set of candidates and to compute a consensus ranking. Commonly, each voter provides a total order of all candidates. Recently, this approach was generalized to bucket orders, which allow ties.In this work we further generalize and consider total, bucket, interval and partial orders. The disagreement between two orders is measured by the nearest neighbor Spearman footrule distance, which has not been studied so far. For two bucket orders and for a total and an interval order the nearest neighbor Spearman footrule distance is shown to be computable in linear time, whereas for a total and a partial order the computation is NP-hard, 4-approximable and fixed-parameter tractable.Moreover, in contrast to the well-known efficient solution of the rank aggregation problem for total orders, we prove the NP-completeness for bucket orders and establish a 4-approximation.