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

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 415-424

  Ailon, Nir ^a  

^a INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; SEARCH ENGINES;

CONSTANT FACTOR APPROXIMATION; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; FULL RANKING; META-SEARCHING; PARTIAL RANKINGS;

APPROXIMATION ALGORITHMS;

EID: 84969170545     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. N. Ailon and M. Charikar. Fitting tree metrics: Hierarchical clustering and phylogeny. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2005.
2. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC), pages 684-693, 2005.
3. N. Ailon, M. Charikar, and A. Newman. Proofs of conjectures in 'aggregating inconsistent information: ranking and clustering'. Technical Report, Princeton University, TR-719-05, 2005.
4. N. Alon. Ranking tournaments. SIAM Journal on Discrete Mathematics, to appear.
5. D. Arnon, G. Collins, and S. McCallum. Cylindrical algebraic decomposition I: The basic algorithm. SIAM J. on Computing, 13, 1984.
6. D. Arnon, G. Collins, and S. McCallum. Cylindrical algebraic decomposition II: The adjacency algorithm for the plane. SIAM J. on Computing, 13, 1984.
7. K. J. Arrow. Social Choice and Individual Values. John Wiley and Sons, New York, 1951.
8. J. Aslam and M. Montague. Condorcet fusion for improved retrieval. In Proceedings of the 11th International Conference on Information and Knowledge Management, pages 538-548, 2002.
9. J. C. Borda. Mémoire sur lesélections au scrutin. Histoire de l'Académie Royale des Sciences, 1781.
10. G. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In Proceedings of the 2nd GI Conference on Automate Theory and Formal Languages, Vol. 33 of Lecture Notes in Computer Science, pages 134-183. Springer-Verlag, Berlin, 1975.
11. M.-J. Condorcet. Éssai sur l'application de l'analyseà la probabilité des décisions rendues a la pluralité des voix. 1785.
12. D. Coppersmith, L. Fleischer, and A. Rudra. 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), 2006.
13. P. Diaconis and R. Graham. Spearman's footrule as a measure of disarray. Journal of the Royal Statistical Society, Series B, 39(2):262-268, 1977.
14. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proceedings of the Tenth International Conference on the World Wide Web (WWW10), pages 613-622, Hong Kong, 2001.
15. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation revisited. Manuscript, 2001.
16. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing partial rankings. SIAM Journal of Discrete Mathematics.
17. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing and Aggregating Rankings with Ties. ACM Symposium on Principles of Database Systems (PODS'04), pages 47-58.
18. R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. In Proceedings of the fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 28-36, Baltimore, 2003.
19. R. Fagin, R. Kumar, and D. Sivakumar. Efficient similarity search and classification via rank aggregation. In Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pages 301-312, San Diego, 2003.
20. V. Filkov and S. Skiena. Integrating microarray data by consensus clustering. In Proceedings of International Conference on Tools with Artificial Intelligence (ICTAI), pages 418-425, Sacramento, 2003.
21. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. In Proceedings of the 21st International Conference on Data Engineering (ICDE), Tokyo, 2005. To appear.
22. J. Hodge and R.E. Klima. The Mathematics of Voting and Elections: A Hands-On Approach, volume 22 Mathematical World. AMS, 2000.
23. J. Kemeny and J. Snell. Mathematical Models in the Social Sciences. Blaisdell, New York, 1962. Reprinted by MIT Press, Cambridge, 1972.
24. J. G. Kemeny. Mathematics without numbers. Daedalus, 88:571-591, 1959.
25. M. Kendall and J. D. Gibbons. Rank correlation methods. Edward Arnold, London, 1990.
26. W. Rand. Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336):846-850, 1971.
27. A. Strehl. Relationship-based clustering and cluster ensembles for high-dimensional data mining. PhD Dissertation, University of Texas at Austin, May 2002.
28. Y. Wakabayashi. The complexity of computing medians of relations. Resenhas, 3(3):323-349, 1998.