Agnostic clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5809 LNAI, Issue , 2009, Pages 384-398

  Balcan, Maria Florina ^a   Röglin, Heiko ^b   Teng, Shang Hua ^c  

^a Georgia Institute of Technology   (United States)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGNOSTIC LEARNING; CLUSTERINGS; DATA CLUSTERING; DATA POINTS; EXTENDED MODEL; UPPER AND LOWER BOUNDS;

CLUSTERING ALGORITHMS;

TARGETS;

EID: 77952057523     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04414-4_31     Document Type: Conference Paper

References (8)

1. Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: STOC (2002)
2. Charikar, M., Guha, S., Tardos, E., Shmoys, D.B.: A constant-factor approximation algorithm for the k-median problem. In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing (1999)
3. Balcan, M.F., Blum, A., Gupta, A.: Approximate clustering without the approximation. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2009)
4. Balcan, M.F., Blum, A., Vempala, S.: A discrimantive framework for clustering via similarity functions. In: Proceedings of the 40th ACM Symposium on Theory of Computing (2008)
5. Balcan, M.F., Braverman, M.: Finding low error clusterings. In: Proceedings of the 22nd Annual Conference on Learning Theory (2009)
6. Kearns, M.J., Schapire, R.E., Sellie, L.M.: Toward efficient agnostic learning. Machine Learning Journal (1994)
7. Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R.,Wu, A.Y.: A local search approximation algorithm for k -means clustering. In: Proceedings of the Eighteenth Annual Symposium on Computational Geometry (2002)
8. Valiant, L.: A theory of the learnable. Commun. ACM 27(11), 1134-1142 (1984)