{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T00:00:39Z","timestamp":1751241639561},"publisher-location":"Cham","reference-count":8,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319566078"},{"type":"electronic","value":"9783319566085"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-56608-5_43","type":"book-chapter","created":{"date-parts":[[2017,4,7]],"date-time":"2017-04-07T06:25:19Z","timestamp":1491546319000},"page":"520-526","source":"Crossref","is-referenced-by-count":3,"title":["Faster K-Means Cluster Estimation"],"prefix":"10.1007","author":[{"given":"Siddhesh","family":"Khandelwal","sequence":"first","affiliation":[]},{"given":"Amit","family":"Awekar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,8]]},"reference":[{"key":"43_CR1","unstructured":"The code and dataset for the experiments can be found at: https:\/\/github.com\/siddheshk\/Faster-Kmeans"},{"key":"43_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: k-means++: the advantages of careful seeding. In: ACM-SIAM Symposium on Discrete algorithms, pp. 1027\u20131035 (2007)"},{"key":"43_CR3","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: International Conference on Machine Learning, pp. 147\u2013153 (2003)"},{"issue":"7","key":"43_CR4","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"43_CR5","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A Likas","year":"2003","unstructured":"Likas, A., Vlassis, N., Verbeek, J.J.: The global k-means clustering algorithm. Pattern Recogn. 36(2), 451\u2013461 (2003)","journal-title":"Pattern Recogn."},{"issue":"2","key":"43_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"SP Lloyd","year":"1982","unstructured":"Lloyd, S.P.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Pelleg, D., Moore, A.: Accelerating exact k-means algorithms with geometric reasoning. In: ACM SIGKDD, pp. 277\u2013281. ACM (1999)","DOI":"10.1145\/312129.312248"},{"issue":"1","key":"43_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1243\/095440605X8298","volume":"219","author":"DT Pham","year":"2005","unstructured":"Pham, D.T., Dimov, S.S., Nguyen, C.: Selection of k in k-means clustering. J. Mech. Eng. Sci. 219(1), 103\u2013119 (2005)","journal-title":"J. Mech. Eng. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-56608-5_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T10:25:17Z","timestamp":1498386317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-56608-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319566078","9783319566085"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-56608-5_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}