{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:47:25Z","timestamp":1780408045805,"version":"3.54.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T00:00:00Z","timestamp":1403136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s11227-014-1225-7","type":"journal-article","created":{"date-parts":[[2014,6,19]],"date-time":"2014-06-19T09:06:52Z","timestamp":1403168812000},"page":"1249-1259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":121,"title":["Optimized big data K-means clustering using\u00a0MapReduce"],"prefix":"10.1007","volume":"70","author":[{"given":"Xiaoli","family":"Cui","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pingfei","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keqiu","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changqing","family":"Ji","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,6,19]]},"reference":[{"key":"1225_CR1","doi-asserted-by":"crossref","unstructured":"Madhulatha TS (2012) An overview on clustering methods[J]. arXiv preprint arXiv:1205.1117","DOI":"10.9790\/3021-0204719725"},{"issue":"3","key":"1225_CR2","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu R, Wunsch D (2005) Survey of clustering algorithms[J]. IEEE Trans Neural Netw 16(3):645\u2013678","journal-title":"IEEE Trans Neural Netw"},{"issue":"1\u20133","key":"1225_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/B:MACH.0000033113.59016.96","volume":"56","author":"P Drineas","year":"2004","unstructured":"Drineas P, Frieze A, Kannan R et al (2004) Clustering large graphs via the singular value decomposition[J]. Mach Learn 56(1\u20133):9\u201333","journal-title":"Mach Learn"},{"issue":"1","key":"1225_CR4","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean J, Ghemawat S (2008) MapReduce: simplified data processing on large clusters[J]. Commun ACM 51(1):107\u2013113","journal-title":"Commun ACM"},{"key":"1225_CR5","unstructured":"Ekanayake J, Pallickara S, Fox G (2008) Mapreduce for data intensive scientific analyses[C]. eScience, eScience\u201908. IEEE fourth international conference on. IEEE 2008, pp 277\u2013284"},{"key":"1225_CR6","unstructured":"Liu T, Rosenberg C, Rowley HA (2007) Clustering billions of images with large scale nearest neighbor search[C]. Applications of Computer Vision, WACV\u201907. IEEE Workshop on. IEEE 2007, p 28"},{"key":"1225_CR7","series-title":"Cloud computing","volume-title":"Parallel k-means clustering based on mapreduce[M]","author":"W Zhao","year":"2009","unstructured":"Zhao W, Ma H, He Q (2009) Parallel k-means clustering based on mapreduce[M]., Cloud computingSpringer, Berlin Heidelberg"},{"key":"1225_CR8","doi-asserted-by":"crossref","unstructured":"Ene A, Im S, Moseley B (2011) Fast clustering using MapReduce[C]. In: Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 681\u2013689","DOI":"10.1145\/2020408.2020515"},{"issue":"4","key":"1225_CR9","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1007\/s00454-011-9340-1","volume":"45","author":"A Vattani","year":"2011","unstructured":"Vattani A (2011) K-means requires exponentially many iterations even in the plane[J]. Discret Comput Geom 45(4):596\u2013616","journal-title":"Discret Comput Geom"},{"key":"1225_CR10","unstructured":"Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding[C]. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. Society for industrial and applied mathematics, pp 1027\u20131035"},{"key":"1225_CR11","doi-asserted-by":"crossref","unstructured":"Wang J, Su X (2011) An improved K-means clustering algorithm[C]. Communication software and networks (ICCSN), 2011 IEEE 3rd international conference on. IEEE, pp 44\u201346","DOI":"10.1109\/ICCSN.2011.6014384"},{"key":"1225_CR12","unstructured":"Davidson I, Satyanarayana A (2003) Speeding up k-means clustering by bootstrap averaging[C]. IEEE data mining workshop on clustering large data sets"},{"issue":"1","key":"1225_CR13","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/360402.360419","volume":"2","author":"F Farnstrom","year":"2000","unstructured":"Farnstrom F, Lewis J, Elkan C (2000) Scalability for clustering algorithms revisited[J]. ACM SIGKDD Explor Newsl 2(1):51\u201357","journal-title":"ACM SIGKDD Explor Newsl"},{"key":"1225_CR14","unstructured":"Domingos P, Hulten G (2001) A general method for scaling up machine learning algorithms and its application to clustering[C]. ICML, pp 106\u2013113"},{"issue":"10","key":"1225_CR15","doi-asserted-by":"crossref","first-page":"1626","DOI":"10.1631\/jzus.2006.A1626","volume":"7","author":"AM Fahim","year":"2006","unstructured":"Fahim AM, Salem AM, Torkey FA et al (2006) An efficient enhanced k-means clustering algorithm[J]. J Zhejiang Univ Sci A 7(10):1626\u20131633","journal-title":"J Zhejiang Univ Sci A"},{"issue":"7","key":"1225_CR16","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo T, Mount DM, Netanyahu NS et al (2002) An efficient k-means clustering algorithm: analysis and implementation [J]. IEEE Trans Pattern Anal Mach Intell 24(7):881\u2013892","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"7","key":"1225_CR17","doi-asserted-by":"crossref","first-page":"622","DOI":"10.14778\/2180912.2180915","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Moseley B, Vattani A et al (2012) Scalable k-means++[J]. Proc VLDB Endow 5(7):622\u2013633","journal-title":"Proc VLDB Endow"},{"key":"1225_CR18","doi-asserted-by":"crossref","unstructured":"Mishra BK, Rath A, Nayak NR et al (2012) Far efficient K-means clustering algorithm[C]. In: Proceedings of the international conference on advances in computing, communications and informatics. ACM, pp 106\u2013110","DOI":"10.1145\/2345396.2345414"},{"issue":"320","key":"1225_CR19","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1080\/01621459.1967.10500923","volume":"62","author":"HP Friedman","year":"1967","unstructured":"Friedman HP, Rubin J (1967) On some invariant criteria for grouping data[J]. J Am Stat Assoc 62(320):1159\u20131178","journal-title":"J Am Stat Assoc"},{"key":"1225_CR20","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"2","author":"DL Davies","year":"1979","unstructured":"Davies DL, Bouldin DW (1979) A cluster separation measure[J]. IEEE Trans Pattern Anal Mach Intell 2:224\u2013227","journal-title":"IEEE Trans Pattern Anal Mach Intell"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1225-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1225-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1225-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T18:13:05Z","timestamp":1565547185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1225-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,19]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["1225"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1225-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,19]]}}}