{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T14:05:32Z","timestamp":1765807532024,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,3,10]],"date-time":"2018-03-10T00:00:00Z","timestamp":1520640000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100009123","name":"Norges Teknisk-Naturvitenskapelige Universitet","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009123","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11227-018-2310-0","type":"journal-article","created":{"date-parts":[[2018,3,10]],"date-time":"2018-03-10T11:15:12Z","timestamp":1520680512000},"page":"2705-2728","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A vectorized k-means algorithm for compressed datasets: design and experimental analysis"],"prefix":"10.1007","volume":"74","author":[{"given":"Abdullah","family":"Al Hasib","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan M.","family":"Cebrian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lasse","family":"Natvig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,10]]},"reference":[{"key":"2310_CR1","unstructured":"Arthur D, Vassilvitskii S (2007) K-means++: the advantages of careful seeding. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp 1027\u20131035"},{"issue":"3","key":"2310_CR2","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TPDS.2008.105","volume":"20","author":"D Ayguad\u00e9","year":"2009","unstructured":"Ayguad\u00e9 D, Copty N, Duran A, Hoefinger J, Lin Y, Massaioli F, Teruel X, Unnikrishnan P, Zhang G (2009) The design of OpenMP tasks. IEEE Trans Parallel Distrib Syst 20(3):401\u2013418","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"2310_CR3","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1177\/109434200001400303","volume":"14","author":"S Browne","year":"2000","unstructured":"Browne S, Dongarra J, Garner N, Ho G, Mucci P (2000) A portable programming interface for performance evaluation on modern processors. Int J High Perform Comput Appl 14(3):189\u2013204","journal-title":"Int J High Perform Comput Appl"},{"key":"2310_CR4","unstructured":"Burks S, Harrell G, Wang J (2015) On initial effects of the K-means clustering. In: Proceedings of the International Conference on Scientific Computing, pp 200\u2013205"},{"issue":"10","key":"2310_CR5","doi-asserted-by":"publisher","first-page":"1370","DOI":"10.1016\/j.jpdc.2008.05.014","volume":"68","author":"S Che","year":"2008","unstructured":"Che S, Boyer M, Meng J, Tarjan D, Sheaffer JW, Skadron K (2008) A performance study of general-purpose applications on graphics processors using CUDA. J Parallel Distrib Comput 68(10):1370\u20131380","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"2310_CR6","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1007\/s11227-014-1225-7","volume":"70","author":"X Cui","year":"2014","unstructured":"Cui X, Zhu P, Yang X, Li K, Ji C (2014) Optimized big data K-means clustering using MapReduce. J Supercomput 70(3):1249\u20131259","journal-title":"J Supercomput"},{"issue":"2","key":"2310_CR7","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s11227-014-1185-y","volume":"69","author":"A Hadian","year":"2014","unstructured":"Hadian A, Shahrivari S (2014) High performance parallel K-means clustering for disk-resident datasets on multi-core CPUs. J Supercomput 69(2):845\u2013863","journal-title":"J Supercomput"},{"key":"2310_CR8","doi-asserted-by":"crossref","unstructured":"Hamerly G (2010) Making k-means even faster. In: 2010 SIAM International Conference on Data Mining, pp 130\u2013140","DOI":"10.1137\/1.9781611972801.12"},{"key":"2310_CR9","doi-asserted-by":"crossref","unstructured":"Hasib AA, Cebri\u00e1n JM, Natvig L (2015) V-pfordelta: data compression for energy efficient computation of time series. In: 2015 IEEE 22nd International Conference on High Performance Computing, pp 416\u2013425","DOI":"10.1109\/HiPC.2015.11"},{"issue":"7","key":"2310_CR10","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo T, Mount DM, Netanyahu NS, Piatko CD, Silverman R, Wu AY (2002) An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans Pattern Anal Mach Intell 24(7):881\u2013892","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"6","key":"2310_CR11","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1002\/spe.2326","volume":"46","author":"D Lemire","year":"2015","unstructured":"Lemire D, Boytsov L, Kurz N (2015) SIMD compression and the intersection of sorted integers. Softw Pract Exp 46(6):723\u2013749","journal-title":"Softw Pract Exp"},{"issue":"2","key":"2310_CR12","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"2006","unstructured":"Lloyd S (2006) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137","journal-title":"IEEE Trans Inf Theory"},{"key":"2310_CR13","unstructured":"Mall R (2015) Sparsity in large scale kernel models. Ph.D. thesis, Leuven Arenberg Doctoral School"},{"key":"2310_CR14","doi-asserted-by":"crossref","unstructured":"Mall R, Jumutc V, Langone R, Suykens JAK (2014) Representative subsets for big data learning using K-NN graphs. In: IEEE International Conference on Big Data, pp 37\u201342","DOI":"10.1109\/BigData.2014.7004210"},{"key":"2310_CR15","doi-asserted-by":"crossref","unstructured":"Mathew J, Vijayakumar R (2015) Enhancement of parallel K-means algorithm. In: Proceedings of the International Conference on Innovations in Information, Embedded and Communication Systems, pp 1\u20136","DOI":"10.1109\/ICIIECS.2015.7193271"},{"issue":"1","key":"2310_CR16","first-page":"1","volume":"99","author":"S Mittal","year":"2015","unstructured":"Mittal S, Vetter J (2015) A survey of architectural approaches for data compression in cache and main memory systems. IEEE Trans Parallel Distrib Syst 99(1):1\u201314","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"2310_CR17","unstructured":"Stephens N (2016) The scalable vector extension (SVE) for the ARMv8-A architecture. \n                    https:\/\/community.arm.com\/groups\/processors\/blog\/2016\/08\/22\/technology-update-the-scalable-vector-extension-sve-for-the-armv8-a-architecture"},{"key":"2310_CR18","unstructured":"Northwestern University, USA (2013) Parallel K-means data clustering. \n                    http:\/\/www.ece.northwestern.edu\/~wkliao\/Kmeans\/index.html"},{"key":"2310_CR19","first-page":"273","volume-title":"Protein\u2013protein interactions\u2014computational and experimental tools","author":"H Ravaee","year":"2012","unstructured":"Ravaee H (2012) Finding protein complexes via fuzzy learning vector quantization algorithm. In: Cai W, Hong H (eds) Protein\u2013protein interactions\u2014computational and experimental tools. InTech, London, United Kingdom, pp 273\u2013284"},{"issue":"12","key":"2310_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/MC.2007.436","volume":"40","author":"S Rivoire","year":"2007","unstructured":"Rivoire S, Shah MA, Ranganathan P, Kozyrakis C, Meza J (2007) Models and metrics to enable energy-efficiency optimizations. Computer 40(12):39\u201348","journal-title":"Computer"},{"key":"2310_CR21","unstructured":"University of California, Irvine (2018) Machine learning repository. \n                    https:\/\/archive.ics.uci.edu\/ml\/datasets.html"},{"key":"2310_CR22","unstructured":"University of California, Irvine (2018) Synthetic control chart dataset. \n                    http:\/\/archive.ics.uci.edu\/ml\/machine-learning-databases\/synthetic_control-mld\/synthetic_control.data.html"},{"key":"2310_CR23","unstructured":"Fr\u00e4nti P et al (2015) Clustering datasets. \n                    http:\/\/cs.uef.fi\/sipu\/datasets\/"},{"issue":"1","key":"2310_CR24","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1109\/TKDE.2014.2324592","volume":"27","author":"J Wang","year":"2015","unstructured":"Wang J, Wang J, Song J, Xu XS, Shen HT, Li S (2015) Optimized cartesian k-means. IEEE Trans Knowl Data Eng 27(1):180\u2013192","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2310_CR25","doi-asserted-by":"crossref","unstructured":"Wu F, Wu Q, Tan Y, Wei L, Shao L, Gao L (2013) A vectorized K-means algorithm for intel many integrated core architecture. In: International Symposium on Advanced Parallel Processing Technologies, pp 277\u2013294","DOI":"10.1007\/978-3-642-45293-2_21"},{"key":"2310_CR26","doi-asserted-by":"crossref","unstructured":"Xiao L, Shao Z, Liu G (2006) K-means algorithm based on particle swarm optimization algorithm for anomaly intrusion detection. In: The Sixth World Congress on Intelligent Control and Automation, vol 2, pp 5854\u20135858","DOI":"10.1109\/WCICA.2006.1714200"},{"key":"2310_CR27","first-page":"224","volume":"2","author":"M Zechner","year":"2009","unstructured":"Zechner M, Granitzer M (2009) K-means on the graphics processor: design and experimental analysis. Int J Adv Syst Meas 2:224\u2013235","journal-title":"Int J Adv Syst Meas"},{"key":"2310_CR28","unstructured":"Zeng G (2012) Fast approximate K-means via cluster closures. In: Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR\u201912, Washington, DC, USA, pp 3037\u20133044"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2310-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2310-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2310-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T19:15:44Z","timestamp":1552158944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2310-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,10]]},"references-count":28,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["2310"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2310-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2018,3,10]]},"assertion":[{"value":"10 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}