{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:17:15Z","timestamp":1778807835789,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,8,21]],"date-time":"2011-08-21T00:00:00Z","timestamp":1313884800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,8,21]]},"DOI":"10.1145\/2020408.2020515","type":"proceedings-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:22:45Z","timestamp":1314804165000},"page":"681-689","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":134,"title":["Fast clustering using MapReduce"],"prefix":"10.1145","author":[{"given":"Alina","family":"Ene","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungjin","family":"Im","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"University of Illinois, Urbana, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Google: Cluster computing and mapreduce. http:\/\/code.google.com\/edu\/submissions\/mapreduce-minilecture\/listing.html.  Google: Cluster computing and mapreduce. http:\/\/code.google.com\/edu\/submissions\/mapreduce-minilecture\/listing.html."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055581"},{"key":"e_1_3_2_1_3_1","first-page":"1027","volume-title":"SODA","author":"Arthur D.","year":"2007","unstructured":"D. Arthur and S. Vassilvitskii . k-means: the advantages of careful seeding . In SODA , pages 1027 -- 1035 , 2007 . D. Arthur and S. Vassilvitskii. k-means: the advantages of careful seeding. In SODA, pages 1027--1035, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702416402"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875536"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276725"},{"key":"e_1_3_2_1_7_1","unstructured":"M. Berry. Mapreduce and k-means clustering. http:\/\/blog.data-miners.com\/2008\/02\/mapreduce-and-k-means-clustering.html 2008.  M. Berry. Mapreduce and k-means clustering. http:\/\/blog.data-miners.com\/2008\/02\/mapreduce-and-k-means-clustering.html 2008."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810535"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702418498"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276719"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796483"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2002.1882"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109687"},{"key":"e_1_3_2_1_14_1","first-page":"826","volume-title":"SODA","author":"Chen K.","year":"2008","unstructured":"K. Chen . A constant factor approximation algorithm for k-median clustering with outliers . In SODA , pages 826 -- 835 , 2008 . K. Chen. A constant factor approximation algorithm for k-median clustering with outliers. In SODA, pages 826--835, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772715"},{"key":"e_1_3_2_1_16_1","first-page":"137","volume-title":"Proceedings of OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified data processing on large clusters . In Proceedings of OSDI , pages 137 -- 150 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified data processing on large clusters. In Proceedings of OSDI, pages 137--150, 2004."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(85)90002-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824786"},{"issue":"293","key":"e_1_3_2_1_19_1","first-page":"306","article-title":"Clustering to minimize the maximum intercluster distance","volume":"38","author":"Gonzalez T. F.","year":"1985","unstructured":"T. F. Gonzalez . Clustering to minimize the maximum intercluster distance . Theoretical Computer Science , 38 : 293 -- 306 , 1985 . T. F. Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293 -- 306, 1985.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198387"},{"key":"e_1_3_2_1_21_1","volume-title":"Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554","author":"Gupta A.","year":"2008","unstructured":"A. Gupta and K. Tangwongsan . Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554 , 2008 . A. Gupta and K. Tangwongsan. Simpler analyses of local search algorithms for facility location. CoRR, abs\/0809.2554, 2008."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.9.11.1093"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.10.2.180"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510012"},{"key":"e_1_3_2_1_25_1","volume-title":"School of Computer Science","author":"Kang U.","year":"2008","unstructured":"U. Kang , C. Tsourakakis , A. P. Appel , C. Faloutsos , and J. Leskovec . Hadi: Fast diameter estimation and mining in massive graphs with hadoop. Technical report , School of Computer Science , Carnegie Mellon University Pittsburgh , December 2008 . U. Kang, C. Tsourakakis, A. P. Appel, C. Faloutsos, and J. Leskovec. Hadi: Fast diameter estimation and mining in massive graphs with hadoop. Technical report, School of Computer Science, Carnegie Mellon University Pittsburgh, December 2008."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873677"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1855013"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_29_1","first-page":"215","volume-title":"PRIS","author":"Ma A.","year":"2007","unstructured":"A. Ma and I. K. Sethi . Distributed k-median clustering with application to image clustering . In PRIS , pages 215 -- 220 , 2007 . A. Ma and I. K. Sethi. Distributed k-median clustering with application to image clustering. In PRIS, pages 215--220, 2007."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807184"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85363-3_14"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701388884"},{"key":"e_1_3_2_1_33_1","volume-title":"The Definitive Guide","author":"White T.","year":"2009","unstructured":"T. White . Hadoop : The Definitive Guide . O'Reilly Media , 2009 . T. White. Hadoop: The Definitive Guide. O'Reilly Media, 2009."}],"event":{"name":"KDD '11: The 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Diego California USA","acronym":"KDD '11","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020515","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2020408.2020515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:16Z","timestamp":1750240096000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2020408.2020515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,21]]},"references-count":33,"alternative-id":["10.1145\/2020408.2020515","10.1145\/2020408"],"URL":"https:\/\/doi.org\/10.1145\/2020408.2020515","relation":{},"subject":[],"published":{"date-parts":[[2011,8,21]]},"assertion":[{"value":"2011-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}