{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T11:39:13Z","timestamp":1791027553303,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374474","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"671-680","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":76,"title":["A discriminative framework for clustering via similarity functions"],"prefix":"10.1145","author":[{"given":"Maria-Florina","family":"Balcan","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avrim","family":"Blum","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Santosh","family":"Vempala","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_31"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060692"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00008-4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794270248"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380808"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143854"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-7550-1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-0587-3"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1051\/ps:2005018"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301257"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946306"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189779"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.56"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11841036_25"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796496"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780550"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"e_1_3_2_1_21_1","volume-title":"Learning Kernel Classifiers","author":"Herbrich R.","year":"2002","unstructured":"R. Herbrich . Learning Kernel Classifiers . MIT Press , Cambridge , 2002 . R. Herbrich. Learning Kernel Classifiers. MIT Press, Cambridge, 2002."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375845"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_30"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_1_25_1","volume-title":"NIPS","author":"Kleinberg J.","year":"2002","unstructured":"J. Kleinberg . An impossibility theorem for clustering . In NIPS , 2002 . J. Kleinberg. An impossibility theorem for clustering. In NIPS, 2002."},{"key":"e_1_3_2_1_26_1","volume-title":"Addison-Wesley","author":"Knuth D. E.","year":"1997","unstructured":"D. E. Knuth . The Art of Computer Programming . Addison-Wesley , 1997 . D. E. Knuth. The Art of Computer Programming. Addison-Wesley, 1997."},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. ICML","author":"Kondor R. I.","year":"2002","unstructured":"R. I. Kondor and J. Lafferty . Diffusion kernels on graphs and other discrete structures . In Proc. ICML , 2002 . R. I. Kondor and J. Lafferty. Diffusion kernels on graphs and other discrete structures. In Proc. ICML, 2002."},{"key":"e_1_3_2_1_28_1","first-page":"529","volume-title":"Proc. 43rd Symp. Foundations of Computer Science","author":"McSherry F.","year":"2001","unstructured":"F. McSherry . Spectral parititioning of random graphs . In Proc. 43rd Symp. Foundations of Computer Science , pages 529 -- 537 , 2001 . F. McSherry. Spectral parititioning of random graphs. In Proc. 43rd Symp. Foundations of Computer Science, pages 529--537, 2001."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4057.001.0001"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.705570"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/975545"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. 20th Annual Conference on Learning Theory","author":"Srebro N.","year":"2007","unstructured":"N. Srebro . How good is a kernel as a similarity function ? In Proc. 20th Annual Conference on Learning Theory , 2007 . N. Srebro. How good is a kernel as a similarity function? In Proc. 20th Annual Conference on Learning Theory, 2007."},{"key":"e_1_3_2_1_33_1","volume-title":"SODA","author":"Swamy C.","year":"2004","unstructured":"C. Swamy . Correlation clustering : Maximizing agreements via semidefinite programming . In SODA , 2004 . C. Swamy. Correlation clustering: Maximizing agreements via semidefinite programming. In SODA, 2004."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_35_1","volume-title":"Statistical Learning Theory","author":"Vapnik V. N.","year":"1998","unstructured":"V. N. Vapnik . Statistical Learning Theory . Wiley and Sons , 1998 . V. N. Vapnik. Statistical Learning Theory. Wiley and Sons, 1998."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.008"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:49Z","timestamp":1750255069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374474"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":35,"alternative-id":["10.1145\/1374376.1374474","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374474","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}