{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T08:19:05Z","timestamp":1765268345745,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T00:00:00Z","timestamp":1459728000000},"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":[[2016,4,4]]},"DOI":"10.1145\/2851613.2851643","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T19:23:42Z","timestamp":1464895422000},"page":"824-831","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["PatchWork, a scalable density-grid clustering algorithm"],"prefix":"10.1145","author":[{"given":"Frank","family":"Gouineau","sequence":"first","affiliation":[{"name":"Computer Research Institute of Montreal, Canada"}]},{"given":"Tom","family":"Landry","sequence":"additional","affiliation":[{"name":"Computer Research Institute of Montreal, Canada"}]},{"given":"Thomas","family":"Triplet","sequence":"additional","affiliation":[{"name":"Computer Research Institute of Montreal, Canada"}]}],"member":"320","published-online":{"date-parts":[[2016,4,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.14778\/2180912.2180915"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/j.patcog.2007.04.010"},{"key":"e_1_3_2_1_3_1","volume-title":"DRW'03","volume":"68","author":"Dai H.","year":"2003","unstructured":"H. Dai and H. Su. Approximation and analytical studies of inter-clustering performances of space-filling curves. In C. Banderier and C. Krattenthaler, editors, Discrete Random Walks, DRW'03, Paris, France, September 1-5, 2003, volume AC of Discrete Mathematics and Theoretical Computer Science Proceedings, pages 53--68. DMTCS, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.5555\/1251254.1251264"},{"issue":"3","key":"e_1_3_2_1_5_1","first-page":"267","article-title":"A survey of clustering algorithms for big data: Taxonomy and empirical analysis. Emerging Topics in Computing","volume":"2","author":"Fahad A.","year":"2014","unstructured":"A. Fahad, N. Alshatri, Z. Tari, A. Alamri, I. Khalil, A. Zomaya, S. Foufou, and A. Bouras. A survey of clustering algorithms for big data: Taxonomy and empirical analysis. Emerging Topics in Computing, IEEE Transactions on, 2(3):267--279, Sept 2014.","journal-title":"IEEE Transactions on"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/945445.945450"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1109\/ICDE.2005.34"},{"volume-title":"Popularity of Spark and Hadoop","year":"2014","unstructured":"Google-Trends. Popularity of Spark and Hadoop, 2014.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/j.ipl.2007.07.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/s11704-013-3158-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.5555\/1771622.1771632"},{"key":"e_1_3_2_1_12_1","first-page":"58","volume-title":"Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98)","author":"Hinneburg A.","year":"1998","unstructured":"A. Hinneburg and D. A. Keim. An efficient approach to clustering in large multimedia databases with noise. In R. Agrawal, P. E. Stolorz, and G. Piatetsky-Shapiro, editors, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98), New York City, New York, USA, August 27-31, 1998, pages 58--65. AAAI Press, 1998."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1109\/ICICSE.2009.17"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/TSMCC.2008.2007252"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1016\/0098-3004(84)90020-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.14778\/2078324.2078327"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/1823854.1823897"},{"key":"e_1_3_2_1_18_1","volume-title":"DBSCAN clustering algorithm on top of Apache Spark","author":"Litouka A.","year":"2015","unstructured":"A. Litouka. DBSCAN clustering algorithm on top of Apache Spark, 2015."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/TIT.1982.1056489"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. 5th Berkeley Symp. Math. Stat. Probab.","author":"MacQueen J.","year":"1967","unstructured":"J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proc. 5th Berkeley Symp. Math. Stat. Probab., 1967."},{"key":"e_1_3_2_1_21_1","first-page":"226","volume-title":"Data Mining and Knowledge Discovery","author":"Martin Ester X. X.","year":"1996","unstructured":"X. X. Martin Ester, Hans-peter Kriegel, J\u00f6rg S. A density-based algorithm for discovering clusters in large spatial databases with noise. In Data Mining and Knowledge Discovery, pages 226--231, 1996."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.5120\/16202-5391"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.5555\/2388996.2389081"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.5555\/645924.671342"},{"key":"e_1_3_2_1_25_1","first-page":"1409","article-title":"A statistical method for evaluating systematic relationships","volume":"28","author":"Sokal R. R.","year":"1958","unstructured":"R. R. Sokal and C. D. Michener. A statistical method for evaluating systematic relationships. University of Kansas Scientific Bulletin, 28:1409--1438, 1958.","journal-title":"University of Kansas Scientific Bulletin"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.5555\/645923.758369"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.3138\/carto.46.4.239"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/SWS.2009.5271791"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1155\/2015\/579391"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.5555\/2228298.2228301"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/1863103.1863113"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1109\/T-C.1971.223083"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1371\/journal.pone.0074685"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.5555\/1947599.1947638"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"acronym":"SAC 2016","name":"SAC 2016: Symposium on Applied Computing","location":"Pisa Italy"},"container-title":["Proceedings of the 31st Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851613.2851643","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851613.2851643","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:04Z","timestamp":1750221544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851613.2851643"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,4]]},"references-count":34,"alternative-id":["10.1145\/2851613.2851643","10.1145\/2851613"],"URL":"https:\/\/doi.org\/10.1145\/2851613.2851643","relation":{},"subject":[],"published":{"date-parts":[[2016,4,4]]},"assertion":[{"value":"2016-04-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}