Rank aggregation: Together we're strong

2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009

Volumn , Issue , 2009, Pages 38-51

  Schalekamp, Frans ^a   Van Zuylen, Anke ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION USE; SEARCH ENGINES;

COMPARISON SORT; FAST ALGORITHMS; FEEDBACK ARC SETS; LOCAL SEARCH ALGORITHM; META SEARCH ENGINES; OPTIMAL SOLUTIONS; RANK AGGREGATION; RELATIVE ORDER;

APPROXIMATION ALGORITHMS;

EID: 84880349211     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972894.4     Document Type: Conference Paper

References (22)

1. N. Ailon. Aggregation of partial rankings, p-ratings and top-m lists. In SODA '07: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Al- gorithms, pages 415-424. SIAM, 2007.
2. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In STOC '05: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, pages 684-693. ACM, 2005.
3. J. Borda. Memoire sur les elections au scrutin. Histoire de l'Academie Royal des Sciences, 1781.
4. S. Chanas and P. Kobylanski. A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl., 6(2):191-205, 1996.
5. T. Coleman and A. Wirth. Ranking tournaments: Local search and a new algorithm. In ALENEX '08: Proceedings of the Workshop on Algorithm Engineering and Experiments. SIAM, 2008.
6. A. Copeland. A 'reasonable' social welfare function. Seminar on Applications of Mathematics to Social Sciences, University of Michigan, USA, 1951.
7. D. Coppersmith, L. Fleischer, and A. Rudra. Ordering by weighted number of wins gives a good ranking for weighted tournaments. In SODA '06: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 776-782. ACM, 2006.
8. P. Diaconis and R. L. Graham. Spearman's footrule as a measure of disarray. J. Roy. Statist. Soc. Ser. B, 39(2):262-268, 1977.
9. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In WWW '01: Proceedings of the 10th International Conference on World Wide Web, pages 613-622. ACM, 2001.
10. R. Fagin, R. Kumar, M. Mahdian, D. Sivakumar, and E. Vee. Comparing partial rankings. SIAM J. Discrete Math., 20(3):628-648, 2006.
11. R. Fagin, R. Kumar, and D. Sivakumar. Comparing top k lists. SIAM J. Discrete Math., 17(1):134-160, 2003.
12. R. Fagin, R. Kumar, and D. Sivakumar. Effcient similarity search and classiffcation via rank aggregation. In SIGMOD '03: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, pages 301-312. ACM, 2003.
13. A. Gionis, H. Mannila, K. Puolamaki, and A. Ukkonen. Algorithms for discovering bucket orders from data. In KDD '06:Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2006.
14. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. ACM Trans. Knowl. Discov. Data, 1(1):4, 2007.
15. A. Goder and V. Filkov. Consensus clustering algorithms: Comparison and reffnement. In ALENEX '08: Proceedings of the Workshop on Algorithm Engineering and Experiments. SIAM, 2008.
16. C. Kenyon-Mathieu and W. Schudy. How to rank with few errors. In STOC '07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 95-103. ACM, 2007.
17. E. L. Lawler. Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York, 1976.
18. L. A. F. Park and K. Ramamohanarao. Mining web multi-resolution community-based popularity for information retrieval. In CIKM '07: Proceedings of the 2007 ACM Conference on Information and Knowledge Management, pages 545-552, November 2007.
19. A. van Zuylen, R. Hegde, K. Jain, and D. P. Williamson. Deterministic pivoting algorithms for constrained ranking and clustering problems. In SODA '07: Proceedings of the 18th Annual ACM-SIAM Sym- posium on Discrete Algorithms, pages 405-414. SIAM, 2007.
20. A. van Zuylen and D. P. Williamson. Deterministic algorithms for rank aggregation and other ranking and clustering problems. In WAOA '07: Proceedings of the 5th Workshop on Approximation and Online Algorithms (WAOA '07), Lecture Notes in Computer Science. Springer, 2007.
21. H. P. Young. Condorcet's theory of voting. Math. Inform. Sci. Humaines, (111):45-59, 1990.
22. H. P. Young and A. Levenglick. A consistent extension of Condorcet's election principle. SIAM J. Appl. Math., 35(2):285-300, 1978..