{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:12:47Z","timestamp":1725538367220},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642044137"},{"type":"electronic","value":"9783642044144"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04414-4_31","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T04:46:05Z","timestamp":1253594765000},"page":"384-398","source":"Crossref","is-referenced-by-count":5,"title":["Agnostic Clustering"],"prefix":"10.1007","author":[{"given":"Maria Florina","family":"Balcan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heiko","family":"R\u00f6glin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shang-Hua","family":"Teng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Jain, K., Mahdian, M., Saberi, A.: A new greedy approach for facility location problems. In: STOC (2002)","DOI":"10.1145\/509907.510012"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/301250.301257"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Balcan, M.F., Blum, A., Gupta, A.: Approximate clustering without the approximation. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (2009)","DOI":"10.1137\/1.9781611973068.116"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1374376.1374474"},{"key":"31_CR5","unstructured":"Balcan, M.F., Braverman, M.: Finding low error clusterings. In: Proceedings of the 22nd Annual Conference on Learning Theory (2009)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Kearns, M.J., Schapire, R.E., Sellie, L.M.: Toward efficient agnostic learning. Machine Learning Journal (1994)","DOI":"10.1007\/BF00993468"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/513400.513402"},{"issue":"11","key":"31_CR8","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L.: A theory of the learnable. Commun. ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04414-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:25:36Z","timestamp":1558538736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04414-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642044137","9783642044144"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04414-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}