Correlation clustering in general weighted graphs

Theoretical Computer Science

Volumn 361, Issue 2-3, 2006, Pages 172-187

  Demaine, Erik D ^a   Emanuel, Dotan ^b   Fiat, Amos ^b   Immorlica, Nicole ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Clustering; Minimum multicut; Partitioning

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; CORRELATION THEORY; GRAPH THEORY; PARAMETER ESTIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; CLUSTERING; MINIMUM MULTICUT; PARTITIONING;

DATABASE SYSTEMS;

EID: 33746868385     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.008     Document Type: Article

References (31)

1. N. Bansal, A. Blum, S. Chawla, Correlation clustering, in: Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science, Vancouver, Canada, November 2002, pp. 238-250.
2. Y. Bejerano, N. Immorlica, J. Naor, M. Smith, Efficient location area planning for personal communication systems, in: Proc. Ninth Annual Internat. Conf. on Mobile Computing and Networking, San Diego, CA, September 2003, pp. 109-121.
3. M. Charikar, V. Guruswami, A. Wirth, Clustering with qualitative information, in: Proc. 44th Annu. IEEE Symp. Foundations of Computer Science, 2003, pp. 524-533.
4. M. Charikar, A. Wirth, Maximizing quadratic programs: extending grothendieck's inequality, in: Proc. 45th Annu. IEEE Symp. on Foundations of Computer Science, 2004, pp. 54-60.
5. Dahlhaus E., Johnson D.S., Papadimitriou C.H., Seymour P.D., and Yannakakis M. The complexity of multiterminal cuts. SIAM J. Comput. 4 23 (1994) 864-894
6. E.D. Demaine, N. Immorlica, Correlation clustering with partial information, in: Proc. Sixth Internat. Workshop on Approximation Algorithms for Combinatorial Optimization Problems, Princeton, NJ, August 2003, pp. 1-13.
7. D. Emanuel, A. Fiat, Correlation clustering-minimizing disagreements on arbitrary weighted graphs, in: Proc. 11th Annu. European Symp. on Algorithms, 2003, pp. 208-220.
8. Ester M., Kriegel H.-P., Sander J., and Xu X. Clustering for mining in large spatial databases. KI-Journal 1 (1998) 18-24 (Special Issue on Data Mining. ScienTec Publishing)
9. Garg N., Vazirani V.V., and Yannakakis M. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25 2 (1996) 235-251
10. Garg N., Vazirani V.V., and Yannakakis M. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18 1 (1997) 3-20
11. Hochbaum D.S., and Shmoys D.B. A unified approach to approximation algorithms for bottleneck problems. J. ACM 33 (1986) 533-550
12. Hu T.C. Multicommodity network flows. Oper. Res. 11 (1963) 344-360
13. K. Jain, V.V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, in: Proc. 40th Annu. Symp. on Foundations of Computer Science, 1999, pp. 2-13.
14. Kanungo T., Mount D.M., Netanyahu N.S., Piatko C.D., Silverman R., and Wu A.Y. An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24 7 (2002) 881-892
15. D. Klein, S.D. Kamvar, C.D. Manning, From instance-level constraints to space-level constraints: making the most of prior knowledge in data clustering, in: Proc. 19th Internat. Conf. on Machine Learning, 2002, pp. 307-314.
16. P.N. Klein, S.A. Plotkin, S. Rao, Excluded minors, network decomposition, and multicommodity flow, in: Proc. 25th Annu. ACM Symp. on Theory of Computing, 1993, pp. 682-690.
17. Leighton T., and Rao S. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46 6 (1999) 787-832
18. J.B. MacQueen, Some methods for classification and analysis of multivariate observations, in: Proc. Fifth Symp. on Mathematical, Statistics, and Probability, 1967, pp. 281-297.
19. M. Meila, D. Heckerman, An experimental comparison of several clustering and initialization methods, Conf. on Uncertainty in Artificial Intelligence, 1998, pp. 386-395.
20. Murtagh F. A survey of recent advances in hierarchical clustering algorithms. Comput. J. 26 4 (1983) 354-359
21. C.M. Procopiuc, Clustering problems and their applications, Department of Computer Science, Duke University. 〈http://www.cs.duke.edu/∼magda/clustering-survey.ps.gz〉.
22. O. Reingold, S.P. Vadhan, A. Wigderson, Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors, Electronic Colloq. on Computational Complexity (ECCC), Vol. 8(18), 2001.
23. M. Satchell, Hunting for good Will: Will the real Shakespeare please stand up? U.S. News and World Report, July 24 2000, pp. 71-72.
24. L.J. Schulman, Clustering for edge-cost minimization, Electronic Colloq. on Computational Complexity (ECCC), Vol. 6(035), 1999.
25. M. Steinbach, G. Karypis, V. Kumar, A comparison of document clustering techniques, KDD-2000 Workshop on Text Mining, 2000.
26. C. Swamy, Correlation clustering: maximizing agreements via semidefinite programming, in: Proc. 15th Annu. ACM-SIAM Symp. on Discrete Algorithms, New Orleans, LA, 2004. Society for Industrial and Applied Mathematics, pp. 526-527.
27. rr-free graphs. Inform. Process. Lett. 47 2 (1993) 77-80
28. Vazirani V.V. Approximation Algorithms (2001), Springer, Berlin
29. K. Wagstaff, C. Cardie, Clustering with instance-level constraints, in: Proc. 17th Internat. Conf. on Machine Learning, 2000, pp. 1103-1110.
30. K. Wagstaff, C. Cardie, S. Rogers, S. Schroedl, Constrained K-means clustering with background knowledge, in: Proc. 18th Internat. Conf. Machine Learning, 2001, pp. 577-584.
31. M. Yannakakis, P.C. Kanellakis, S.C. Cosmadakis, C.H. Papadimitriou, Cutting and partitioning a graph after a fixed pattern, in: Proc. 10th Internat. Colloq. on Automata, Languages and Programming, 1983, pp. 712 -722.