{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:43Z","timestamp":1750307083305,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"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":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339734","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"1312-1320","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Two approaches to understanding when constraints help clustering"],"prefix":"10.1145","author":[{"given":"Ian","family":"Davidson","sequence":"first","affiliation":[{"name":"University of California - Davis, Davis, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_2_1_1","DOI":"10.1145\/1014052.1014062"},{"volume-title":"Advances in Algorithms","author":"Clustering Constrained","unstructured":"Constrained Clustering : Advances in Algorithms , Theory, and Applications Editors: Sugato Basu, Ian Davidson , Kiri L. Wagstaff. CRC Press . Constrained Clustering: Advances in Algorithms, Theory, and Applications Editors: Sugato Basu, Ian Davidson, Kiri L. Wagstaff. CRC Press.","key":"e_1_3_2_2_2_1"},{"key":"e_1_3_2_2_3_1","first-page":"6","author":"Bar-Hillel A.","year":"2005","unstructured":"A. Bar-Hillel , T. Hertz , N. Shental , D. Weinshall , Learning a Mahalanobis metric from equivalence constraints. JMLR 6 ( 2005 ). A. Bar-Hillel, T. Hertz, N. Shental, D. Weinshall, Learning a Mahalanobis metric from equivalence constraints. JMLR 6 (2005).","journal-title":"JMLR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_4_1","DOI":"10.5555\/795663.796353"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_5_1","DOI":"10.5555\/3120676.3120693"},{"doi-asserted-by":"publisher","key":"e_1_3_2_2_6_1","DOI":"10.1007\/s10618-006-0053-7"},{"key":"e_1_3_2_2_7_1","volume-title":"IJCAI","author":"Gomes C.","year":"2007","unstructured":"C. Gomes , A. Sabharwal , and B. Selman , From Sampling to Model Counting , IJCAI , Hyderabad, India , Jan 2007 . C. Gomes, A. Sabharwal, and B. Selman, From Sampling to Model Counting, IJCAI, Hyderabad, India, Jan 2007."},{"key":"e_1_3_2_2_8_1","first-page":"57","author":"Goodman L.","year":"1962","unstructured":"L. Goodman , The Variance of the Product of K Random Variables , JASA V 57 , No 297 p 54--60, 1962 . L. Goodman, The Variance of the Product of K Random Variables, JASA V 57, No 297 p 54--60, 1962.","journal-title":"JASA"},{"key":"e_1_3_2_2_10_1","volume-title":"Approximations for NP-hard Problems","author":"Jerrum M.","year":"1996","unstructured":"M. Jerrum , A. Sinclair , \" The MCMC method : an approach to approximate counting and integration \", In Approximations for NP-hard Problems , 1996 . M. Jerrum, A. Sinclair, \"The MCMC method: an approach to approximate counting and integration\", In Approximations for NP-hard Problems, 1996."},{"key":"e_1_3_2_2_11_1","volume-title":"Introduction to Graph Theory","author":"West D. B.","year":"2001","unstructured":"D. B. West , Introduction to Graph Theory , 2 nd Edition, Prentice Hall, Inc. , 2001 . D. B. West, Introduction to Graph Theory, 2nd Edition, Prentice Hall, Inc., 2001.","edition":"2"},{"key":"e_1_3_2_2_12_1","volume-title":"ICML","author":"Wagstaff K.","year":"2000","unstructured":"K. Wagstaff & C. Cardie . Clustering with Instance-Level Constraints , ICML 2000 . K. Wagstaff & C. Cardie. Clustering with Instance-Level Constraints, ICML 2000."},{"unstructured":"K. Wagstaff C. Cardie S. Rogers & S. Schroedl \"Constrained \u03ba-means Clustering with Background Knowledge\" ICML 2001.   K. Wagstaff C. Cardie S. Rogers & S. Schroedl \"Constrained \u03ba-means Clustering with Background Knowledge\" ICML 2001.","key":"e_1_3_2_2_13_1"},{"key":"e_1_3_2_2_15_1","volume-title":"NIPS 15","author":"Xing E.","year":"2003","unstructured":"E. Xing , A. Ng , M. Jordan , and S. Russell . Distance metric learning, with application to clustering with side-information . NIPS 15 , 2003 . E. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. NIPS 15, 2003."}],"event":{"sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"acronym":"KDD '12","name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Beijing China"},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339734","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:17Z","timestamp":1750239257000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339734"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":13,"alternative-id":["10.1145\/2339530.2339734","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339734","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}