{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:42:53Z","timestamp":1742931773016,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319232362"},{"type":"electronic","value":"9783319232379"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23237-9_17","type":"book-chapter","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T09:48:07Z","timestamp":1440409687000},"page":"193-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimisation Techniques for Parallel K-Means on MapReduce"],"prefix":"10.1007","author":[{"given":"Sami","family":"Al Ghamdi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Di Fatta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederic","family":"Stahl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,25]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least Squares Quantization in PCM. IEEE Trans. Inf. Theor. 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-46502-2_13","volume-title":"Large-Scale Parallel Data Mining","author":"IS Dhillon","year":"2000","unstructured":"Dhillon, I.S., Modha, D.S.: A data-clustering algorithm on distributed memory multiprocessors. In: Zaki, M.J., Ho, C.-T. (eds.) KDD 1999. LNCS (LNAI), vol. 1759, pp. 245\u2013260. Springer, Heidelberg (2000)"},{"key":"17_CR3","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: Proceedings of the 6th Conference on Symposium on Operating Systems Design & Implementation, 6, p. 10. Berkeley, CA, USA (2004)"},{"key":"17_CR4","unstructured":"Elkan, C.: Using the triangle inequality to accelerate k-means. In: presented at the International Conference on Machine Learning - ICML, pp. 147\u2013153 (2003)"},{"issue":"9","key":"17_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J Bentley","year":"1975","unstructured":"Bentley, J.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Pelleg, D., Moore, A.: Accelerating exact K-means algorithms with geometric reasoning. In: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 277\u2212281, New York, NY, USA (1999)","DOI":"10.1145\/312129.312248"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1109\/34.709614","volume":"20","author":"D Judd","year":"1998","unstructured":"Judd, D., Mckinley, P.K., Jain, A.K.: Large-scale parallel data clustering. IEEE Trans. Pattern Anal. Mach. Intell. 20, 871\u2013876 (1998)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Pettinger, D., Di Fatta, G.: Scalability of efficient parallel K-means. In: 2009 5th IEEE International Conference on E-Science Workshops, pp. 96\u2013101 (2009)","DOI":"10.1109\/ESCIW.2009.5407991"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Di Fatta, G., Pettinger, D.: Dynamic load balancing in parallel KD-tree K-means. In: IEEE International Conference on Scalable Computing and Communications, pp. 2478\u20132485 (2010)","DOI":"10.1109\/CIT.2010.424"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Ghemawat, S., Gobioff, H., Leung, S.-T.: The google file system. In: Proceedings of the 19th ACM Symposium on Operating Systems Principles, pp. 29\u201343. New York, NY, USA (2003)","DOI":"10.1145\/1165389.945450"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Shvachko, K., Kuang, H., Radia, S., Chansler, R.: The hadoop distributed file system. In: Proceedings of the 2010 IEEE 26th Symposium on Mass Storage Systems and Technologies (MSST), pp. 1\u201310. Washington, DC, USA (2010)","DOI":"10.1109\/MSST.2010.5496972"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-642-10665-1_71","volume-title":"Cloud Computing","author":"W Zhao","year":"2009","unstructured":"Zhao, W., Ma, H., He, Q.: Parallel K-means clustering based on mapreduce. In: Jaatun, M.G., Zhao, G., Rong, C. (eds.) Cloud Computing. LNCS, vol. 5931, pp. 674\u2013679. Springer, Heidelberg (2009)"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"White, B., Yeh, T., Lin, J., Davis, L.: Web-scale computer vision using mapreduce for multimedia data mining. In: Proceedings of the Tenth International Workshop on Multimedia Data Mining, pp. 9:1\u20139:10. New York, NY, USA (2010)","DOI":"10.1145\/1814245.1814254"},{"key":"17_CR14","unstructured":"Apache Hadoop. http:\/\/hadoop.apache.org\/. Accessed on 03 January 2015"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Pettinger, D., Di Fatta, G.: Space partitioning for scalable K-means. In: IEEE The Ninth International Conference on Machine Learning and Applications (ICMLA 2010), pp. 319-324. Washington DC, USA, 12\u201314 December 2010","DOI":"10.1109\/ICMLA.2010.46"}],"container-title":["Lecture Notes in Computer Science","Internet and Distributed Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23237-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T18:12:07Z","timestamp":1718043127000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23237-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319232362","9783319232379"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23237-9_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"25 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}