{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:54:57Z","timestamp":1767034497464,"version":"3.40.3"},"publisher-location":"Heidelberg","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319000312"},{"type":"electronic","value":"9783319000329"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-00032-9_42","type":"book-chapter","created":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T07:36:11Z","timestamp":1372664171000},"page":"371-378","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A New Distance Function for Prototype Based Clustering Algorithms in High Dimensional Spaces"],"prefix":"10.1007","author":[{"given":"Roland","family":"Winkler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Klawonn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rudolf","family":"Kruse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,22]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-49257-7","volume-title":"When is nearest neighbor meaningful? In Database theory - ICDT\u201999","author":"K. Beyer","year":"1999","unstructured":"Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999). When is nearest neighbor meaningful? In Database theory - ICDT\u201999, vol.1540 of Lecture notes in computer science (pp.\u00a0217\u2013235). Berlin\/Heidelberg: Springer."},{"key":"42_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0450-1","volume-title":"Pattern recognition with fuzzy objective function algorithms","author":"J. C. Bezdek","year":"1981","unstructured":"Bezdek, J.\u00a0C. (1981). Pattern recognition with fuzzy objective function algorithms. New York: Plenum Press."},{"issue":"11","key":"42_CR3","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/0167-8655(91)90002-4","volume":"12","author":"R. N. Dave","year":"1991","unstructured":"Dave, R.\u00a0N. (1991). Characterization and detection of noise in clustering. Pattern Recognition Letters, 12(11), 657\u2013664.","journal-title":"Pattern Recognition Letters"},{"issue":"3","key":"42_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1080\/01969727308546046","volume":"3","author":"J. C. Dunn","year":"1973","unstructured":"Dunn, J. C. (1973). A fuzzy relative of the isodata process and its use in detecting compact well-separated clusters. Cybernetics and Systems: An International Journal, 3(3), 32\u201357.","journal-title":"Cybernetics and Systems: An International Journal"},{"issue":"4","key":"42_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/j.jco.2009.02.011","volume":"25","author":"R. J. Durrant","year":"2008","unstructured":"Durrant, R.\u00a0J., & Kab\u00e1n, A. (2008). When is \u2018nearest neighbour\u2019 meaningful: A converse theorem and implications. Journal of Complexity, 25(4), 385\u2013397.","journal-title":"Journal of Complexity"},{"key":"42_CR6","first-page":"506","volume-title":"VLDB \u201900: Proceedings of the 26th international conference on very large data bases","author":"A. Hinneburg","year":"2000","unstructured":"Hinneburg, A., Aggarwal, C.\u00a0C., & Keim, D.\u00a0A. (2000). What is the nearest neighbor in high dimensional spaces? In VLDB \u201900: Proceedings of the 26th international conference on very large data bases (pp.\u00a0506\u2013515). San Francisco, CA: Morgan Kaufmann Publishers."},{"issue":"4","key":"42_CR7","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1109\/TKDE.2008.178","volume":"21","author":"C. -M. Hsu","year":"2009","unstructured":"Hsu, C. -M., & Chen, M. -S. (2009). On the design and applicability of distance functions in high-dimensional data space. IEEE Transactions on Knowledge and Data Engineering, 21(4), 523\u2013536.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"42_CR8","first-page":"1","volume":"1","author":"R. Winkler","year":"2011","unstructured":"Winkler, R., Klawonn, F., & Kruse, R. (2011). Fuzzy c-means in high dimensional spaces. IJFSA, 1(1), 1\u201316.","journal-title":"IJFSA"}],"container-title":["Studies in Classification, Data Analysis, and Knowledge Organization","Statistical Models for Data Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-00032-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T22:39:38Z","timestamp":1676327978000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-00032-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319000312","9783319000329"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-00032-9_42","relation":{},"ISSN":["1431-8814"],"issn-type":[{"type":"print","value":"1431-8814"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"22 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}