Aggregating inconsistent information: Ranking and clustering

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 684-693

  Ailon, Nir ^a   Charikar, Moses ^a   Newman, Alantha ^b  

^a Princeton University   (United States)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Consensus Clustering; Correlation Clustering; Minimum Feedback Arc Set; Rank Aggregation; Tournament

Indexed keywords

CONSENSUS CLUSTERING; CORRELATION CLUSTERING; MINIMUM FEEDBACK ARC SET; RANK AGGREGATION; TOURNAMENT;

ALGORITHMS; APPROXIMATION THEORY; SET THEORY;

PROBLEM SOLVING;

EID: 34848818026     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060692     Document Type: Conference Paper

References (31)

1. N. Ailon, M. Charikar, and A. Newman. Proofs of conjectures in 'aggregating inconsistent information: Ranking and clustering'. Technical Report TR-719-05, Princeton University, 2005.
2. N. Alon. Ranking tournaments (draft). Personal communication, 2004.
3. N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, New York, 1992.
4. S. Arora, A. Frieze, and H. Kaplan. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. In Proceedings of the 37th, Annual Symposium on the Foundations of Computer Science (FOCS), pages 24-33, Burlington, VT, 1996.
5. J. Bang-Jensen and C. Thomassen. A polynomial algorithm for the 2-path problem in semicomplete graphs. SIAM Journal of Discrete Mathematics, 5(3):366-376, 1992.
6. N. Bansal, A. Blum, and S. Chawla. Correlation clustering. Machine Learning Journal (Special Issue on Theoretical Advances in Data Clustering), 56(1-3):89-113, 2004. Extended abstract appeared in FOGS 2002, pages 238-247.
7. J. Bartholdi, C. A. Tovey, and M. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6(2);157-165, 1989.
8. J. C. Borda. Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences, 1781.
9. M.-C. Cai, X. Deng, and W. Zang. An approximation algorithm for feedback vertex sets in tournaments. SIAM Journal on Computing, 30(6):1993-2007, 2001.
10. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 524-533, Boston, 2003.
11. M.-J. Condorcet. Éssai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. 1785.
12. 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.
13. I. Dinur and S. Safra. On the importance of being biased. In Proceedings of the 34th Annual Symposium on the Theory of Compututing (STOC), pages 33-42, 2002.
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, arid D. Sivakumar. Rank aggregation revisited. 2001. Manuscript.
16. G. Even, J. S. Naor, M. Sudan, and B. Schieber. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20(2):151-174, 1998.
17. 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.
18. 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.
19. A. Frieze and R. Kannan. Quick approximations to matrices and applications. Combinatorica, 19(2):175-220, 1999.
20. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. In Proceedings of the 21st International Conference on Data Engineering (ICDE), Tokyo, 2005. To appear.
21. J. Håstad. Some optimal inapproximability results. Journal of the ACM, 48:798-859, 2001.
22. R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85-104. Plenum Press, New York, 1972.
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. A. Newman. Approximating the maximum acyclic subgraph. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA, June 2000.
26. A. Newman and S. Vempala, Fences are futile: On relaxations for the linear ordering problem. In Proceedings of the Eighth Conference on Integer Programming and Combinatorial Optimization (IPCO), pages 333-347, 2001.
27. C. N. Potts. An algorithm for the single machine sequencing problem with precedence constraints. Mathematical Programming, 13:78-87, 1980.
28. P. Seymour. Packing directed circuits fractionally. Combinatorica, 15:281-288, 1995.
29. E. Speckenmeyer. On feedback problems in digraphs. Graph Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, 411:218-231, 1989.
30. A. Strehl. Relationship-based Clustering and Cluster-Ensembles for High-dimensional Data Mining. PhD dissertation, University of Texas at Austin, May 2002.
31. Y. Wakabayashi. The complexity of computing medians of relations. Resenhas, 3(3):323-349, 1998.