The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
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.
KeywordsRanking Rank aggregation Partial orders Spearman footrule distance Fixed-parameter tractability
- Aslam JA, Montague MH (2001) Models for metasearch. In: Proc of the 24th annual international ACM SIGIR conference on research and development in information retrieval (SIGIR). ACM Press, New York, pp 275–284 Google Scholar
- Borda JC (1781) Mémoire aux les élections au scrutin Google Scholar
- Brandenburg FJ, Gleißner A, Hofmeier A (2011) The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders. In: Proc of the 5th international frontiers of algorithmics workshop and the 7th international conference on algorithmic aspects of information and management (FAW-AAIM). LNCS, vol 6681. Springer, Berlin, pp 352–363 CrossRefGoogle Scholar
- Brandenburg FJ, Gleißner A, Hofmeier A (2012) Comparing and aggregating partial orders with Kendall tau distances. In: Proc of the 6th international workshop on algorithms and computation (WALCOM). LNCS. Springer, Berlin Google Scholar
- Condorcet MJ (1785) Éssai sur l’application de l’analyse à la probalité des décisions rendues à la pluralité des voix Google Scholar
- Critchlow DE (1985) Metric methods for analyzing partially ranked data. In: Lecture Notes in Statistics, vol 34. Springer, Berlin Google Scholar
- Dwork C, Kumar R, Naor M, Sivakumar D (2001) Rank aggregation methods for the web. In: Proc of the 10th international world wide web conference (WWW), pp 613–622 Google Scholar
- Garey MR, Johnson DS (1990) Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, New York Google Scholar
- Hausdorff F (1978) Set theory (reprint). Chelsea, New York Google Scholar
- Lebanon G, Lafferty JD (2002) Cranking: combining rankings using conditional probability models on permutations. In: Proc of the 19th international conference on machine learning (ICML). Morgan Kaufmann, San Mateo, pp 363–370 Google Scholar
- Lullus R (1283) Artifitium electionis personarum Google Scholar
- Montague MH, Aslam JA (2002) Condorcet fusion for improved retrieval. In: Proc of the 2002 ACM international conference on information and knowledge management (CIKM). ACM Press, New York, pp 538–548 Google Scholar
- Sese J, Morishita S (2001) Rank aggregation method for biological databases. Genome Inform 12:506–507 Google Scholar
- Xia L, Conitzer V (2008) Determining possible and necessary winners under common voting rules given partial orders. In: Proc of the 23rd AAAI conference on artificial intelligence (AAAI). AAAI Press, Menlo Park, pp 196–201 Google Scholar