Correlation Clustering

Machine Learning

Volumn 56, Issue 1-3, 2004, Pages 89-113

  Bansal, Nikhil ^a   Blum, Avrim ^a   Chawla, Shuchi ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Approximation algorithm; Clustering; Document classification

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; DATABASE SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; METRIC SYSTEM; PARAMETER ESTIMATION; RESEARCH; THEOREM PROVING;

APPROXIMATION ALGORITHMS; CLUSTERING; DOCUMENT CLASSIFICATION; K-MEDIA;

LEARNING SYSTEMS;

EID: 3142665421     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:MACH.0000033116.57574.95     Document Type: Article

References (26)

1. Alon, N., Fischer, E., Krivelevich, M., & Szegedy, M. (2000). Efficient testing of large graphs. Combinatorica, 20:4, 451-476.
2. Alon, N., & Spencer, J. H. (1992). The probabilistic method. John Wiley and Sons.
3. Arora, S., Frieze, A., & Kaplan, H. (2002). A new founding procedure for the assignment problem with applications to dense graph arrangements. Mathematical Programming, 92:1, 1-36.
4. Arora, S., Karger, D., & Karpinski, M. (1999). Polynomial time approximation schemes for dense instances of NP-Hard problems. JCSS, 58:1, 193-210.
5. Ben-David, S., Long, P. M., & Mansour, Y. (2001). Agnostic boosting. In Proceedings of the 2001 Conference on Computational Learning Theory (pp. 507-516).
6. 3/14)-coloring algorithm for 3-colorable graphs. IPL: Information Processing Letters, 61.
7. Charikar, M., & Guha, S. (1999). Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science.
8. Charikar, M., Guruswami, V., & Wirth, A. (2003). Clustering with qualitative information. In Proceedings of the 44th Annual Symposium on Foundations of Computer Science (pp. 524-533).
9. Cohen, W., & McCallum, A. (2001). Personal communication.
10. Cohen, W., & Richman, J. (2001). Learning to match and cluster entity names. In ACM SIGIR'01 Workshop on Mathematical/Formal Methods in IR.
11. Cohen, W., & Richman, J. (2002). Learning to match and cluster large high-dimensional data sets for data integration. In Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD).
12. Condon, A., & Karp, R. (1999). Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18:2, 116-140.
13. de la Vega, F. (1996). MAX-CUT has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8:3, 187-198.
14. Demaine, E., & Immorlica, N. (2003). Correlation clustering with partial information. In Proceedings of APPROX.
15. Emanuel, D., & Fiat, A. (2003). Correlation clustering - Minimizing disagreements on arbitrary weighted graphs. In Proceedings of ESA.
16. Garey, M., & Johnson, D. (2000). Computers and intractability: A guide to the theory of NP-completeness. W. H. Freeman and Company.
17. Goldreich, O., Goldwasser, S., & Ron, D. (1998). Property testing and its connection to learning and approximation. JACM, 45:4, 653-750.
18. Hochbaum, D., & Shmoys, D. (1986). A unified approach to approximation algorithms for bottleneck problems. JACM, 33, 533-550.
19. Jain, K., & Vazirani, V. (2001). Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation. JACM, 48:2, 274-296.
20. Kearns, M. (1998). Efficient noise-tolerant learning from statistical queries. JACM, 45:6, 983-1006.
21. Kearns, M. J., Schapire, R. E., & Sellie, L. M. (1994). Toward efficient agnostic learning. Machine Learning, 17:2/3, 115-142.
22. McSherry, F. (2001). Spectral partitioning of random graphs. In Proceedings of the 42th Annual Symposium on Foundations of Computer Science (pp. 529-537).
23. Parnas, M., & Ron, D. (2002). Testing the diameter of graphs. Random Structures and Algorithms, 20:2, 165-183.
24. Schulman, L. (2000). Clustering for edge-cost minimization. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (pp. 547-555).
25. Shamir, R., & Tsur, D. (2002). Improved algorithms for the random cluster graph model. In Proceedings of the Scandinavian Workshop on Algorithmic Theory (pp. 230-239).
26. Swamy, C. (2004). Correlation clustering: Maximizing agreements via semidefinite programming. In Proceedings of the Symposium on Discrete Algorithms.