{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T23:41:54Z","timestamp":1774050114108,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540439776","type":"print"},{"value":"9783540456438","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45643-0_13","type":"book-chapter","created":{"date-parts":[[2007,9,25]],"date-time":"2007-09-25T00:58:33Z","timestamp":1190681913000},"page":"166-177","source":"Crossref","is-referenced-by-count":52,"title":["Acceleration of K-Means and Related Clustering Algorithms"],"prefix":"10.1007","author":[{"given":"Steven J.","family":"Phillips","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,12]]},"reference":[{"key":"13_CR1","volume-title":"The UCI KDD Archive","author":"S. D. Bay","year":"1999","unstructured":"S. D. Bay. The UCI KDD Archive [ http:\/\/kdd.ics.uci.edu ]. Irvine, CA: University of California, Department of Information and Computer Science., 1999."},{"key":"13_CR2","unstructured":"P. S. Bradley, U. M. Fayyad, and C. Reina. Scaling clustering algorithms to large databases. In Knowledge Discovery and Data Mining, pages 9\u201315, 1998."},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. Dempster","year":"1977","unstructured":"A. Dempster, N. Laird, and D. Rubin. Maximum-likelihood from incomplete data via the EM algorithm. J. Royal Statistical Society B, 39:1\u201338, 1977.","journal-title":"J. Royal Statistical Society B"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"F. Farnstrom","year":"2000","unstructured":"F. Farnstrom, J. Lewis, and C. Elkan. Scalability for clustering algorithms revisited. SIGKDD Explorations, 2(1):51\u201357, 2000.","journal-title":"SIGKDD Explorations"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T. F. Gonzalez","year":"1985","unstructured":"T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293\u2013306, 1985.","journal-title":"Theoretical Computer Science"},{"key":"13_CR6","volume-title":"Introductory Digital Image Processing, A Remote Sensing Perspective","author":"J. R. Jensen","year":"1996","unstructured":"J. R. Jensen. Introductory Digital Image Processing, A Remote Sensing Perspective. Prentice Hall, Upper Saddle River, NJ, 1996."},{"key":"13_CR7","first-page":"281","volume":"1","author":"J. MacQueen","year":"1967","unstructured":"J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proc. Fifth Berkeley Symposium on Mathematics, Statistics and Probability, volume 1, pages 281\u2013296, 1967.","journal-title":"Proc. Fifth Berkeley Symposium on Mathematics, Statistics and Probability"},{"key":"13_CR8","unstructured":"A. W. Moore. The anchors hierarchy: Using the triangle inequality to survive high dimensional data. In Proc. UAI-2000: The Sixteenth Conference on Uncertainty in Artificial Intelligence, 2000."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"D. Pelleg and A. W. Moore. Accelerating exact k-means algorithms with geometric reasoning. In Proc. Fifth International Conference on Knowledge Discovery and Data Mining. AAAI Press, 1999.","DOI":"10.1145\/312129.312248"},{"key":"13_CR10","volume-title":"Pattern Recognition Principles","author":"J. T. Tou","year":"1977","unstructured":"J. T. Tou and R. C. Gonzalez. Pattern Recognition Principles. Addison-Wesley, Reading, MA, 1977."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experiments"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45643-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T05:20:17Z","timestamp":1737436817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45643-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439776","9783540456438"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45643-0_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}