Aggregation of partial rankings, p-ratings and top-m lists

Algorithmica (New York)

Volumn 57, Issue 2, 2010, Pages 284-300

  Ailon, Nir ^a  

^a GOOGLE INC   (United States)

Author keywords

Approximation algorithms; Rank aggregation; Ranking with ties

Indexed keywords

CONSTANT FACTOR APPROXIMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; E-COMMERCE; FULL RANKING; META-SEARCHING; PARTIAL RANKINGS; RANK AGGREGATION;

INFORMATION RETRIEVAL; INFORMATION SERVICES; SEARCH ENGINES;

APPROXIMATION ALGORITHMS;

EID: 77949269646     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-008-9211-1     Document Type: Article

References (27)

1. Ailon, N.: Aggregation of partial rankings, p-ratings and top-m lists. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 415-424 (2007)
2. Ailon, N., Charikar, M.: Fitting tree metrics: Hierarchical clustering and phylogeny. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 73-82 (2005)
3. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 684-693 (2005)
4. Ailon, N., Charikar, M., Newman, A.: Proofs of conjectures in 'Aggregating inconsistent information: Ranking and clustering'. Technical Report, Princeton University, TR-719-05 (2005)
5. N. Alon 2006 Ranking tournaments SIAM J. Discrete Math. 20 1 137 142 1112.05043 10.1137/050623905 2257251 (Pubitemid 46352091)
6. Arrow, K.J.: Social Choice and Individual Values. Wiley, New York (1951)
7. Aslam, J., Montague, M.: Condorcet fusion for improved retrieval. In: Proceedings of the 11th International Conference on Information and Knowledge Management, pp. 538-548 (2002)
8. Borda, J.C.: Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences (1781)
9. Condorcet, M.-J.: Éssai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (1785)
10. Coppersmith, D., Fleischer, L., Rudra, A.: Ordering by weighted number of wins gives a good ranking for weighted tournamnets. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 776-782 (2006)
11. P. Diaconis R. Graham 1977 Spearman's footrule as a measure of disarray J. R. Stat. Soc. Ser. B 39 2 262 268 0375.62045 652736
12. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the Tenth International Conference on the World Wide Web (WWW10), pp. 613-622, Hong Kong (2001)
13. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation revisited. Manuscript (2001)
14. Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing and aggregating rankings with ties. In: Proceedings of the ACM Symposium on Principles of Database Systems (PODS), pp. 47-58 (2004)
15. R. Fagin R. Kumar M. Mahdian D. Sivakumar E. Vee 2006 Comparing partial rankings SIAM J. Discrete Math. 20 3 628 648 1121.06002 10.1137/05063088X 2272220 (Pubitemid 47250574)
16. Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 28-36, Baltimore (2003)
17. Fagin, R., Kumar, R., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pp. 301-312, San Diego (2003)
18. Filkov, V., Skiena, S.: Integrating microarray data by consensus clustering. In: Proceedings of International Conference on Tools with Artificial Intelligence (ICTAI), pp. 418-425, Sacramento (2003)
19. Gionis, A., Mannila, H., Tsaparas, P.: Clustering aggregation. TKDD 1(1) (2007)
20. Hodge, J., Klima, R.E.: The Mathematics of Voting and Elections: A Hands-On Approach. Mathematical World, vol. 22. Am. Math. Soc., Providence (2000)
21. Kemeny, J., Snell, J.: Mathematical Models in the Social Sciences. Blaisdell, Boston (1962). Reprinted by MIT Press, Cambridge (1972)
22. J.G. Kemeny 1959 Mathematics without numbers Daedalus 88 571 591
23. Kendall, M., Gibbons, J.D.: Rank Correlation Methods. Arnold, Sevenoaks (1990)
24. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC'07: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 95-103. Assoc. Comput. Mach., New York, 2007 (Pubitemid 47630725)
25. W. Rand 1971 Objective criteria for the evaluation of clustering methods J. Am. Stat. Assoc. 66 336 846 850 10.2307/2284239
26. Strehl, A.: Relationship-based clustering and cluster ensembles for high-dimensional data mining. Ph.D. Dissertation, University of Texas at Austin, May 2002
27. Y. Wakabayashi 1998 The complexity of computing medians of relations Resenhas 3 3 323 349 1098.68618 1633009