{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:17:03Z","timestamp":1771024623684,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642049200","type":"print"},{"value":"9783642049217","type":"electronic"}],"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-04921-7_31","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T11:46:25Z","timestamp":1253619985000},"page":"303-312","source":"Crossref","is-referenced-by-count":2,"title":["On the Efficiency of Swap-Based Clustering"],"prefix":"10.1007","author":[{"given":"Pasi","family":"Fr\u00e4nti","sequence":"first","affiliation":[]},{"given":"Olli","family":"Virmajoki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1009653226428","volume":"5","author":"B. Fritzke","year":"1997","unstructured":"Fritzke, B.: The LBG-U method for vector quantization \u2013 an improvement over LBG inspired from neural networks. Neural Processing Letters\u00a05(1), 35\u201345 (1997)","journal-title":"Neural Processing Letters"},{"issue":"5","key":"31_CR2","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/j.patcog.2005.09.012","volume":"39","author":"P. Fr\u00e4nti","year":"2006","unstructured":"Fr\u00e4nti, P., Virmajoki, O.: Iterative shrinking method for clustering problems. Pattern Recognition\u00a039(5), 761\u2013765 (2006)","journal-title":"Pattern Recognition"},{"key":"31_CR3","doi-asserted-by":"publisher","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 Recognition\u00a036, 451\u2013461 (2003)","journal-title":"Pattern Recognition"},{"issue":"10","key":"31_CR4","doi-asserted-by":"publisher","first-page":"2726","DOI":"10.1117\/1.601810","volume":"37","author":"T. Kaukoranta","year":"1998","unstructured":"Kaukoranta, T., Fr\u00e4nti, P., Nevalainen, O.: Iterative split-and-merge algorithm for VQ codebook generation. Optical Engineering\u00a037(10), 2726\u20132732 (1998)","journal-title":"Optical Engineering"},{"issue":"7","key":"31_CR5","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/S0031-3203(96)00140-9","volume":"30","author":"H. Frigui","year":"1997","unstructured":"Frigui, H., Krishnapuram, R.: Clustering by competitive agglomeration. Pattern Recognition\u00a030(7), 1109\u20131119 (1997)","journal-title":"Pattern Recognition"},{"issue":"11","key":"31_CR6","doi-asserted-by":"publisher","first-page":"3043","DOI":"10.1117\/1.601531","volume":"36","author":"P. Fr\u00e4nti","year":"1997","unstructured":"Fr\u00e4nti, P., Kaukoranta, T., Nevalainen, O.: On the splitting method for vector quantization codebook generation. Optical Engineering\u00a036(11), 3043\u20133051 (1997)","journal-title":"Optical Engineering"},{"issue":"1","key":"31_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10479-006-0154-0","volume":"150","author":"M.G.C. Resende","year":"2007","unstructured":"Resende, M.G.C., Werneck, R.F.: A fast swap-based local search procedure for location problems. Ann. Oper. Res.\u00a0150(1), 205\u2013230 (2007)","journal-title":"Ann. Oper. Res."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1109\/ICME.2008.4607565","volume-title":"IEEE Int. Conf. on Multimedia and Expo. (ICME 2008)","author":"P. Fr\u00e4nti","year":"2008","unstructured":"Fr\u00e4nti, P., Tuononen, M., Virmajoki, O.: Deterministic and randomized local search algorithms for clustering. In: IEEE Int. Conf. on Multimedia and Expo. (ICME 2008), pp. 837\u2013840. Hannover, Germany (2008)"},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/s100440070007","volume":"3","author":"P. Fr\u00e4nti","year":"2000","unstructured":"Fr\u00e4nti, P., Kivij\u00e4rvi, J.: Randomised local search algorithm for the clustering problem. Pattern Analysis and Applications\u00a03(4), 358\u2013369 (2000)","journal-title":"Pattern Analysis and Applications"},{"issue":"1","key":"31_CR10","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comgeo.2004.03.003","volume":"28","author":"T. Kanungo","year":"2004","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N., Piatko, C., Silverman, R., Wu, A.Y.: A local search approximation algorithm for k-means clustering. Computational Geometry\u00a028(1), 89\u2013112 (2004)","journal-title":"Computational Geometry"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nti, P., Virmajoki, O., Hautam\u00e4ki, V.: Probabilistic clustering by random swap algorithm. In: IAPR Int. Conf. on Pattern Recognition (ICPR 2008), Tampa, FL, USA (2008)","DOI":"10.1109\/ICPR.2008.4761798"},{"issue":"8","key":"31_CR12","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1109\/83.855429","volume":"9","author":"T. Kaukoranta","year":"2000","unstructured":"Kaukoranta, T., Fr\u00e4nti, P., Nevalainen, O.: A fast exact GLA based on code vector activity detection. IEEE Trans. on Image Processing\u00a09(8), 1337\u20131342 (2000)","journal-title":"IEEE Trans. on Image Processing"},{"issue":"12","key":"31_CR13","doi-asserted-by":"publisher","first-page":"3677","DOI":"10.1016\/j.patcog.2008.06.005","volume":"41","author":"J.Z.C. Lai","year":"2008","unstructured":"Lai, J.Z.C., Liaw, Y.-C.: Improvement of the k-means clustering filtering algorithm. Pattern Recognition\u00a041(12), 3677\u20133681 (2008)","journal-title":"Pattern Recognition"},{"key":"31_CR14","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: Int. Conf. on Machine Leearning (ICML 2003), pp. 147\u2013153 (2003)"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Natural Computing Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04921-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T19:27:16Z","timestamp":1558553236000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04921-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049200","9783642049217"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04921-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}