Deterministic pivoting algorithms for constrained ranking and clustering problems

Mathematics of Operations Research

Volumn 34, Issue 3, 2009, Pages 594-620

  Van Zuylen, Anke ^a   Williamson, David P ^b  

^a TSINGHUA UNIVERSITY   (China)

^b School of Chemical and Molecular Engineering   (United States)

Author keywords

Approximation algorithm; Consensus clustering; Correlation clustering; Derandomization; Hierarchical clustering; Minimum feedback arc set in tournaments; Rank aggregation

Indexed keywords

CONSENSUS CLUSTERING; CORRELATION CLUSTERING; DERANDOMIZATION; HIERARCHICAL CLUSTERING; MINIMUM FEEDBACK ARC SET IN TOURNAMENTS; RANK AGGREGATION;

APPROXIMATION ALGORITHMS; BIOLOGY; CAVITY RESONATORS; CELLULAR RADIO SYSTEMS; SET THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

CLUSTERING ALGORITHMS;

EID: 70349272838     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0385     Document Type: Article

References (35)

1. Agrawal, M., N. Kayal, N. Saxena. 2004. PRIMES is in P. Ann. Math. 160(2) 781-793.
2. Ailon, N. 2007. Aggregation of partial rankings, p-ratings and top-m lists. Proc. 18th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA '07), 415-424.
3. Ailon, N., M. Charikar. 2005. Fitting tree metrics: Hierarchical clustering and phylogeny. Proc. 46th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS '05), 73-82.
4. Ailon, N., M. Charikar, A. Newman. 2008. Aggregating inconsistent information: Ranking and clustering. J. ACM 55(5) 1-27.
5. Alon, N. 2006. Ranking tournaments. SIAM J. Discret. Math. 20(1) 137-142.
6. Alon, N., J. H. Spencer. 2000. The prob abilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization, 2nd ed. Wiley-Interscience [John Wiley & Sons], New York.
7. Arora, S., A. M. Frieze, H. Kaplan. 1996. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Proc. 37th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS '96), 21-30.
8. Arrow, K. J. 1951. Social Choice and Individual Values. Cowles Commission Monograph No. 12. John Wiley & Sons, Inc., New York.
9. Asuncion, A., D. J. Newman. 2007. UCI machine learning repository. School of Information and Computer Science, University of California, Irvine. http://www.ics.uci.edu/-mlearn/MLRepository.htm.
10. Bansal, N., A. Blum, S. Chawla. 2004. Correlation clustering. Machine Learn. 56(1-3) 89-113.
11. Bartholdi, J. J., C. A. Tovey, M. A. Trick. 1989. Voting schemes for which it can be difficult to tell who won the election. Soc. Choice Welfare 6 157-165.
12. Charbit, P., S. Thomassé, A. Yeo. 2007. The minimum feedback arc set problem is NP-hard for tournaments. Combin. Probab. Comput. 16(1) 1-4.
13. Charikar, M., V. Guruswami, A. Wirth. 2003. Clustering with qualitative information. Proc. 44th Annual IEEE Sympos. Foundations Comput. Sci. (FOCS '03), 524-533.
14. Conitzer, V. 2006. Computing Slater rankings using similarities among candidates. Proc. 21st National Conf. Artificial Intelligence (AAAI '06).
15. Coppersmith, D., L. Fleischer, A. Rudra. 2006. Ordering by weighted number of wins gives a good ranking for weighted tournaments. Proc. 17th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA '06), 776-782.
16. Dwork, C., R. Kumar, M. Naor, D. Sivakumar. 2001. Rank aggregation methods for the Web. Proc. 10th Internal Conf. World Wide Web (WWW '01), 613-622.
17. Erdos, P., J. Spencer. 1974. Probabilistic methods in combinatorics. Probability and Mathematical Statistics, Vol.17. Academic Press [subsidiary of Harcourt Brace Jovanovich Publishers], New York and London.
18. Even, G., J. Naor, B. Schieber, M. Sudan. 1998. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica 20(2) 151-174.
19. Fagin, R., R. Kumar, M. Mahdian, D. Sivakumar, E. Vee. 2006. Comparing partial rankings. SIAM J. Discrete Math. 20(3) 628-648.
20. Filkov, V., S. Skiena. 2003. Integrating microarray data by consensus clustering. Proc. 15th IEEE Internat. Conf. Tools Artificial Intelligence (ICTAI '03), 418-425.
21. Frieze, A. M., R. Kannan. 1999. Quick approximation to matrices and applications. Combinatorica 19(2) 175-220.
22. Gionis, A., H. Mannila, P. Tsaparas. 2007. Clustering aggregation. ACM Trans. Knowledge Discovery Data 1(1) 4.
23. Goder, A., V. Filkov. 2008. Consensus clustering algorithms: Comparison and refinement. Proc. Workshop Algorithm Engrg. Experiments. (ALENEX '08).
24. Harb, B., S. Kannan, A. McGregor. 2005. Approximating the best-fit tree under Lp norms. Approximation, Randomization and Combinatorial Optimization, Lecture Notes in Computer Science, Vol.3624. Springer, Berlin, 123-133.
25. Hegde, R., K. Jain. Personal communication.
26. Karp, R. M. 1972. Reducibility among combinatorial problems. Complexity of Computer Computations, Proc. Sympos., IBM Thomas J. Watson Research Center, Yorktown Heights, NY. Plenum, New York, 85-103.
27. Kemeny, J. G. 1959. Mathematics without numbers. Daedalus 88 575-591.
28. Kenyon-Mathieu, C., W. Schudy. 2007. How to rank with few errors. Proc. 39th Annual ACM Sympos. Theory Comput. (STOC '07), 95-103.
29. Křivánek, M., J. Morávek. 1986. NP-hard problems in hierarchical-tree clustering. Acta Inform. 23(3) 311-323.
30. Modha, D., S. Spangler. 2003. Feature weighting in k-means clustering. Machine Learn. 52(3) 217-237.
31. Modha, D. S., W. S. Spangler. 2000. Clustering hypertext with applications to Web searching. Proc. 11th ACM Hypertext Hypermedia (HYPERTEXT '00), 143-152.
32. Seymour, P. D. 1995. Packing directed circuits fractionally. Combinatorica 15(2) 281-288.
33. Wakabayashi, Y. 1998. The complexity of computing medians of relations. Resenhas 3(3) 323-349.
34. Van Zuylen, A., D. P. Williamson. 2008. Deterministic algorithms for rank aggregation and other ranking and clustering problems. 5th International Workshop on Approximation and Online Algorithms (WAOA'07), Lecture Notes in Computer Science, Vol.4927. Springer, Berlin, 260-273.
35. Van Zuylen, A., R. Hegde, K. Jain, D. P. Williamson. 2007. Deterministic pivoting algorithms for constrained ranking and clustering problems. Proc. 18th Annual ACM-SIAM Sympos. Discrete Algorithms (SODA '07), 405-414.