Correlation clustering

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2002, Pages 238-247

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

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; GRAPH THEORY; PROBABILITY; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; CORRELATION CLUSTERING; DISAGREEMENTS;

COMPUTER SCIENCE;

EID: 0036949730     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Efficient testing of large graphs. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 645-655, 1999.
2. N. Alon and J. H. Spencer. The Probabilistic Method. John Wiley and Sons, 1992.
3. S. Arora, A. Frieze, and H. Kaplan. A new rounding procedure for the assignment problem with applications to dense graph arrangements. In Proc. IEEE FOCS, pages 21-30, 1996.
4. S. Arora, D. Karger, and M. Karpinski. Polynomial time approximation schemes for dense instances of np-hard problems. In ACM Symposium on Theory of Computing, 1995.
5. N. Bansal, A. Blum, and S. Chawla. Correlation clustering (http://www.cs.cmu.edu/!schuchi/papers/clusteringfull.ps). Manuscript, 2002.
6. S. Ben-David, P. M. Long, and Y. Mansour. Agnostic boosting. In Proceedings of the 2001 Conference on Computational Learning Theory, pages 507-516, 2001.
7. M. Charikar and S. Guha. Improved combinatorial algorithms for the facility location and k-median problems. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999.
8. W. Cohen and A. McCallum. Personal communication, 2001.
9. W. Cohen and J. Richman. Learning to match and cluster entity names. In ACM SIGIR'01 workshop on Mathematical/Formal Methods in IR, 2001.
10. W. Cohen and J. Richman. 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), 2002.
11. A. Condon and R. Karp. Algorithms for graph partitioning on the planted partition model. Random Structures and Algorithms, 18(2):116-140, 1999.
12. F. de la Vega. Max-cut has a randomized approximation scheme in dense graphs. Random Structures and Algorithms, 8(3):187-198, 1996.
13. O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653-750, 1998.
14. D. Hochbaum and D. Shmoys. A unified approach to approximation algorithms for bottleneck problems. JACM, 33:533-550, 1986.
15. K. Jain and V. Vazirani. Primal-dual approximation algorithms for metric facility location and k-median problem. In Proc. 40th IEEE FOCS, 1999.
16. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pages 392-401, 1993.
17. M. J. Kearns, R. E. Schapire, and L. M. Sellie. Toward efficient agnostic learning. Machine Learning, 17(2/3):115-142, 1994.
18. F. McSherry. Spectral partitioning of random graphs. In FOCS, pages 529-537, 2001.
19. M. Parnas and D. Ron. Testing the diameter of graphs. In Proceedings of RANDOM, pages 85-96, 1999.
20. L. Schulman. Clustering for edge-cost minimization. In ACM STOC, pages 547-555, 2000.