{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:51Z","timestamp":1750306671332,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T00:00:00Z","timestamp":1400544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["60921002","61202055, 60925009, 61100011"],"award-info":[{"award-number":["60921002","61202055, 60925009, 61100011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP0987236, DP110104628, DP130101970"],"award-info":[{"award-number":["DP0987236, DP110104628, DP130101970"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2012AA010902","2011CB302504"],"award-info":[{"award-number":["2012AA010902","2011CB302504"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,5,20]]},"DOI":"10.1145\/2597917.2597918","type":"proceedings-article","created":{"date-parts":[[2014,6,20]],"date-time":"2014-06-20T13:06:05Z","timestamp":1403269565000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["A collaborative divide-and-conquer K-means clustering algorithm for processing large data"],"prefix":"10.1145","author":[{"given":"Huimin","family":"Cui","sequence":"first","affiliation":[{"name":"SKL of Computer Architecture, Institute of Computing Technology, CAS, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gong","family":"Ruan","sequence":"additional","affiliation":[{"name":"University of Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingling","family":"Xue","sequence":"additional","affiliation":[{"name":"University of New South Wales, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xie","sequence":"additional","affiliation":[{"name":"SKL of Computer Architecture, Institute of Computing Technology, CAS, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Wang","sequence":"additional","affiliation":[{"name":"SKL of Computer Architecture, Institute of Computing Technology, CAS, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaobing","family":"Feng","sequence":"additional","affiliation":[{"name":"SKL of Computer Architecture, Institute of Computing Technology, CAS, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,5,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache lucene. http:\/\/lucene.apache.org\/.  Apache lucene. http:\/\/lucene.apache.org\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Apache mahout. http:\/\/mahout.apache.org\/.  Apache mahout. http:\/\/mahout.apache.org\/."},{"key":"e_1_3_2_1_3_1","unstructured":"Parallel k-means data clustering. http:\/\/users.eecs.northwestern.edu\/wkliao\/Kmeans\/.  Parallel k-means data clustering. http:\/\/users.eecs.northwestern.edu\/wkliao\/Kmeans\/."},{"key":"e_1_3_2_1_4_1","unstructured":"Wikipedia database download. \"http:\/\/en.wikipedia.org\/wiki\/Wikipedia:Database download\".  Wikipedia database download. \"http:\/\/en.wikipedia.org\/wiki\/Wikipedia:Database download\"."},{"key":"e_1_3_2_1_5_1","volume-title":"NIPS","author":"Arlon N.","year":"2009","unstructured":"N. Arlon , R. Jaiswal , and C. Monteleoni . Streaming k-means approximation . In NIPS , 2009 . N. Arlon, R. Jaiswal, and C. Monteleoni. Streaming k-means approximation. In NIPS, 2009."},{"key":"e_1_3_2_1_6_1","first-page":"1027","volume-title":"Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . k-means++: the advantages of careful seeding . In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07 , pages 1027 -- 1035 , Philadelphia, PA, USA , 2007 . Society for Industrial and Applied Mathematics. D. Arthur and S. Vassilvitskii. k-means++: the advantages of careful seeding. In Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '07, pages 1027--1035, Philadelphia, PA, USA, 2007. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180915"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780548"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780550"},{"key":"e_1_3_2_1_11_1","first-page":"245","volume-title":"Workshop on Large-Scale Parallel KDD Systems, SIGKDD","author":"Dhillon I. S.","year":"2000","unstructured":"I. S. Dhillon and D. S. Modha . A data-clustering algorithm on distributed memory multiprocessors . In Workshop on Large-Scale Parallel KDD Systems, SIGKDD , pages 245 -- 260 , London, UK , 2000 . I. S. Dhillon and D. S. Modha. A data-clustering algorithm on distributed memory multiprocessors. In Workshop on Large-Scale Parallel KDD Systems, SIGKDD, pages 245--260, London, UK, 2000."},{"key":"e_1_3_2_1_12_1","first-page":"340","volume-title":"PDPTA","author":"Farivar R.","year":"2008","unstructured":"R. Farivar , D. Rebolledo , E. Chan , and R. H. Campbell . A parallel implementation of k-means clustering on gpus . In PDPTA , pages 340 -- 345 , 2008 . R. Farivar, D. Rebolledo, E. Chan, and R. H. Campbell. A parallel implementation of k-means clustering on gpus. In PDPTA, pages 340--345, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/380995.381010"},{"key":"e_1_3_2_1_14_1","first-page":"293","volume-title":"Theoretical Computer Science","author":"Gonzalez T. F.","year":"1985","unstructured":"T. F. Gonzalez . Clustering to minimize the maximum intercluster distance . In Theoretical Computer Science , pages 293 -- 306 , 1985 . T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. In Theoretical Computer Science, pages 293--306, 1985."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198387"},{"key":"e_1_3_2_1_16_1","volume-title":"FOCS","author":"Guha S.","year":"2000","unstructured":"S. Guha , N. Mishra , R. Motwani , and L. O'Callaghan . \"clustering data streams\". In FOCS , 2000 . S. Guha, N. Mishra, R. Motwani, and L. O'Callaghan. \"clustering data streams\". In FOCS, 2000."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_3_2_1_18_1","volume-title":"computing on data streams technical report","author":"Henzinger M. R.","year":"1998","unstructured":"M. R. Henzinger , P. Raghavan , and S. Rajagopalan . \" computing on data streams technical report \". In Digital Equipment Corporation, Systems Research Center , 1998 . M. R. Henzinger, P. Raghavan, and S. Rajagopalan. \"computing on data streams technical report\". In Digital Equipment Corporation, Systems Research Center, 1998."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/177424.178042"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.709614"},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"Parallel k-means clustering algorithm on nows","author":"Kantabutra S.","year":"1999","unstructured":"S. Kantabutra and A. Couch . Parallel k-means clustering algorithm on nows . NECTEC Technical Journal , 1 , 1999 . S. Kantabutra and A. Couch. Parallel k-means clustering algorithm on nows. NECTEC Technical Journal, 1, 1999.","journal-title":"NECTEC Technical Journal"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2004.03.003"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(89)90036-7"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_27_1","volume-title":"Theoretical Computer Science","author":"Munro J. I.","year":"1980","unstructured":"J. I. Munro and M. S. Paterson . \" selection and sorting with limited storage \". In Theoretical Computer Science , 1980 . J. I. Munro and M. S. Paterson. \"selection and sorting with limited storage\". In Theoretical Computer Science, 1980."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.75"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.89059"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5120\/211-358"},{"key":"e_1_3_2_1_31_1","volume-title":"CLUSTERING METHODS","author":"Rokach L.","year":"2010","unstructured":"L. Rokach and O. Maimon . CLUSTERING METHODS , Chapter 15, Data Mining and Knowledge Discovery Handbook. Springer , 2010 . L. Rokach and O. Maimon. CLUSTERING METHODS, Chapter 15, Data Mining and Knowledge Discovery Handbook. Springer, 2010."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/361219.361220"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652137"},{"key":"e_1_3_2_1_35_1","first-page":"1646","volume-title":"International Conference on Machine Learning and Cybernetics","author":"Zhang Y.","year":"2004","unstructured":"Y. Zhang , J. Sun , Y. Zhang , and X. Zhang . Parallel implementation of clarans using pvm . In International Conference on Machine Learning and Cybernetics , pages 1646 -- 1649 , 2004 . Y. Zhang, J. Sun, Y. Zhang, and X. Zhang. Parallel implementation of clarans using pvm. In International Conference on Machine Learning and Cybernetics, pages 1646--1649, 2004."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10665-1_71"}],"event":{"name":"CF'14: Computing Frontiers Conference","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"],"location":"Cagliari Italy","acronym":"CF'14"},"container-title":["Proceedings of the 11th ACM Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597917.2597918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2597917.2597918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:50Z","timestamp":1750230050000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597917.2597918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,20]]},"references-count":36,"alternative-id":["10.1145\/2597917.2597918","10.1145\/2597917"],"URL":"https:\/\/doi.org\/10.1145\/2597917.2597918","relation":{},"subject":[],"published":{"date-parts":[[2014,5,20]]},"assertion":[{"value":"2014-05-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}