{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T16:26:00Z","timestamp":1743783960619},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642013065"},{"type":"electronic","value":"9783642013072"}],"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-01307-2_61","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T09:47:58Z","timestamp":1240048078000},"page":"620-627","source":"Crossref","is-referenced-by-count":2,"title":["Pairwise Constrained Clustering for Sparse and High Dimensional Feature Spaces"],"prefix":"10.1007","author":[{"given":"Su","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongwon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Lee","family":"Giles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","unstructured":"Basu, S., Bilenko, M., Mooney, R.J.: A probabilistic framework for semi-supervised clustering. In: ACM KDD, Seattle, WA, USA, pp. 59\u201368 (2004)","DOI":"10.1145\/1014052.1014062"},{"key":"61_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49257-7_15","volume-title":"Database Theory - ICDT\u201999","author":"K. Beyer","year":"1998","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., Shaft, U.: When is nearest neighbor meaningful? In: Beeri, C., Bruneman, P. (eds.) ICDT 1999. LNCS, vol.\u00a01540, pp. 217\u2013235. Springer, Heidelberg (1998)"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Bilenko, M., Basu, S., Mooney, R.J.: Integrating constraints and metric learning in semi-supervised clustering. In: ICML, Banff, Alberta, Canada (2004)","DOI":"10.1145\/1015330.1015360"},{"key":"61_CR4","unstructured":"Cohn, D., Caruana, R., McCallum, A.: Semi-supervised clustering with user feedback. Technical report, Cornell University (2003)"},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"Ji, X., Xu, W.: Document clustering with prior knowledge. In: ACM SIGIR, Seattle, WA, USA, pp. 405\u2013412 (2006)","DOI":"10.1145\/1148170.1148241"},{"key":"61_CR6","unstructured":"Klein, D., Kamvar, S.D., Manning, C.D.: From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In: ICML, Sydney, Australia, pp. 307\u2013314 (2002)"},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1023\/A:1026039313770","volume":"43","author":"H. Park","year":"2003","unstructured":"Park, H., Jeon, M., Rosen, J.B.: Lower dimensional representation of text data based on centroids and least squares. BIT Numerical Mathematics\u00a043, 427\u2013448 (2003)","journal-title":"BIT Numerical Mathematics"},{"key":"61_CR8","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. In: IEEE Trans. on Pattern Analysis and Machine Intelligence (PAMI) (2000)"},{"key":"61_CR9","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., Schr\u00f6dl, S.: Constrained k-means clustering with background knowledge. In: ICML, pp. 577\u2013584 (2001)"},{"key":"61_CR10","unstructured":"Xing, E., Ng, A., Jordan, M., Russell, S.: Distance metric learning, with application to clustering with side-information. In: NIPS, Vancouver, Canada (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01307-2_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:06:47Z","timestamp":1558264007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01307-2_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013065","9783642013072"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01307-2_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}