{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:32:54Z","timestamp":1773235974230,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540664437","type":"print"},{"value":"9783540483113","type":"electronic"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48311-x_205","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:16:48Z","timestamp":1269897408000},"page":"1451-1454","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Parallel k\/h-Means Clustering for Large Data Sets"],"prefix":"10.1007","author":[{"given":"Kilian","family":"Stoffel","sequence":"first","affiliation":[]},{"given":"Abdelkader","family":"Belkoniene","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,8,6]]},"reference":[{"key":"205_CR1","unstructured":"M.R. Anderberg. Cluster Analysis for Applications. Academic Press, 1973."},{"key":"205_CR2","unstructured":"John A. Hatigan. Clustering Algorithms. John Wiley and Sons, 1975."},{"key":"205_CR3","unstructured":"W. Kloesgen and J.M. Zytkow. Knowledge discovery in database terminology. Advances in Knowledge Discovery and Data Mining, pages 573\u2013592, 1996."},{"key":"205_CR4","unstructured":"J.B. MacQueen. Some methods for classification and analysis of multivariate observations. Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability, 1967."},{"key":"205_CR5","doi-asserted-by":"crossref","unstructured":"C.F. Olson. Parallel algorithms for hierarchical clustering. Parallel Computing, 21, 1995.","DOI":"10.1016\/0167-8191(95)00017-I"},{"key":"205_CR6","doi-asserted-by":"crossref","unstructured":"E.M. Rasmussen and P. Willett. Efficiency of hierarchical agglomerative clustering using the icl distributed array oricessor. Journal of Documentation, 45(1), 1989.","DOI":"10.1108\/eb026836"},{"key":"205_CR7","unstructured":"Helmuth Spaeth. Cluster Analysis Algorithms. John Wiley and Sons, 1980."},{"key":"205_CR8","unstructured":"Kilian Stoffel. Pattern matching in time series. Technical Report University of Neuch\u00e2tel, September 1998."}],"container-title":["Lecture Notes in Computer Science","Euro-Par\u201999 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48311-X_205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T11:30:53Z","timestamp":1591875053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48311-X_205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664437","9783540483113"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48311-x_205","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"6 August 1999","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}