Finding low error clusterings

COLT 2009 - The 22nd Conference on Learning Theory

Volumn , Issue , 2009, Pages

  Balcan, Maria Florina ^a   Braverman, Mark ^a  

^a MICROSOFT RESEARCH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

C-APPROXIMATION ALGORITHMS; CLUSTERING APPLICATIONS; CLUSTERING PROBLEMS; CLUSTERINGS; CORRELATION CLUSTERING; OBJECTIVE FUNCTIONS; SIMILARITY INFORMATIONS; TARGET CLUSTERING;

APPROXIMATION ALGORITHMS;

PROBLEM SOLVING;

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

References (29)

1. D. Achlioptas and F. McSherry. On spectral learning of mixtures of distributions. In Prooceedings of the Eighteenth Annual Conference on Learning Theory, 2005.
2. M. Ackerman and S. Ben-David. Which data sets are clusterable? - a theoretical study of clusterability. In NIPS, 2008.
3. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proceedings of the 37th ACM Symposium on Theory of Computing, 2005.
4. N. Alon, S. Dar, M. Parnas, and D. Ron. Testing of clustering. In Proceedings of STOC, 2000.
5. S. Arora and R. Kannan. Learning mixtures of arbitrary gaussians. In STOC, 2005.
6. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala, and V. Pandit. Local search heuristics for k-median and facility location problems. SIAMJ. Comput., 33(3), 2004.
7. M.-F. Balcan, A. Blum, and A. Gupta. Approximate clustering without the approximation. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 2009.
8. M.-F. Balcan, A. Blum, and S. Vempala. A discrimantive framework for clustering via similarity functions. In STOC, 2008.
9. Y. Bartal, M. Charikar, and D. Raz. Approximating min-sum k-clustering in metric spaces. In Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001.
10. S. Ben-David. A framework for statistical clustering with constant time approximation for k-median and k-means clustering. Machine Learning, 66(2-3), 2007.
11. A. Blum, N. Bansal, and S. Chawla. Correlation clustering. Machine Learning, 56: 89-113, 2004.
12. M. Charikar, S. Guha, E. Tardos, and D. B. Shmoy. A constant-factor approximation algorithm for the k-median problem. In STOC, 1999.
13. 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, 2003.
14. A. Czumaj and C. Sohler. Sublinear-time approximation for clustering via random samples. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), 2004.
15. A. Czumaj and C. Sohler. Small space representations for metric min-sum k-clustering and their applications. In Proceedings of the 24th International Symposium on Theoretical Aspects of Computer Science, 2007.
16. S. Dasgupta. Learning mixtures of gaussians. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999.
17. W. Fernandez de la Vega, Marek Karpinski, Claire Kenyon, and Yuval Rabani. Approximation schemes for clustering problems. In Proceedings for the Thirty-Fifth Annual ACM Symposium on Theory of Computing, 2003.
18. L. Devroye, L. Gyorfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer-Verlag, 1996.
19. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley, 2001.
20. P. Indyk. Sublinear time algorithms for metric space problems. In STOC, 1999.
21. K. Jain, M. Mahdian, and A. Saberi. A new greedy approach for facility location problems. In 34th STOC, 2002.
22. T. Joachims and J. Hopcroft. Error bounds for correlation clustering. In Proceedings of the International Conference on Machine Learning, 2005.
23. R. Kannan, H. Salmasian, and S. Vempala. The spectral method for general mixture models. In 18th COLT, 2005.
24. J. Kleinberg. An impossibility theorem for clustering. In NIPS, 2002.
25. A. Kumar, Y. Sabharwal, and S. Sen. A simple linear time (1 + ∈)-approximation algorithm for k-means clustering in any dimensions. In 45th FOCS, 2004.
26. M. Meila. Comparing clusterings by the variation of information. In COLT, 2003.
27. M. Meila. Comparing clusterings - an axiomatic view. In International Conference on Machine Learning, 2005.
28. L.J. Schulman. Clustering for edge-cost minimization. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000.
29. S. Vempala and G. Wang. A spectral algorithm for learning mixture models. JCSS, 68(2): 841-860, 2004.