{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T03:33:47Z","timestamp":1784864027877,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"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,8,13]]},"DOI":"10.1145\/2939672.2939750","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"1025-1034","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["AnyDBC"],"prefix":"10.1145","author":[{"given":"Son T.","family":"Mai","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ira","family":"Assent","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Storgaard","sequence":"additional","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICISIP.2004.1287631"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1032649.1033435"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316758"},{"key":"e_1_3_2_1_4_1","first-page":"32","volume-title":"DASFAA","author":"Dash M.","year":"2001","unstructured":"M. Dash , H. Liu , and X. Xu . ' 1+1 > 2': Merging distance and density based clustering . In DASFAA , pages 32 -- 39 , 2001 . M. Dash, H. Liu, and X. Xu. '1+1 > 2': Merging distance and density based clustering. In DASFAA, pages 32--39, 2001."},{"key":"e_1_3_2_1_5_1","first-page":"226","volume-title":"KDD","author":"Ester M.","year":"1996","unstructured":"M. Ester , H.-P. Kriegel , J. Sander , and X. Xu . A Density- Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise . In KDD , pages 226 -- 231 , 1996 . M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density- Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In KDD, pages 226--231, 1996."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737792"},{"key":"e_1_3_2_1_7_1","volume-title":"TU Eindhoven","author":"Gunawan A.","year":"2013","unstructured":"A. Gunawan . A Faster Algorithm for DBSCAN. Msc thesis , TU Eindhoven , 2013 . A. Gunawan. A Faster Algorithm for DBSCAN. Msc thesis, TU Eindhoven, 2013."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDAR.2013.231"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2008.4594646"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.95"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.13"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0797-0"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2013.39"},{"key":"e_1_3_2_1_14_1","volume-title":"F. Manne, and A. N. Choudhary. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. In SC, page 62","author":"Patwary M. M. A.","year":"2012","unstructured":"M. M. A. Patwary , D. Palsetia , A. Agrawal , W. keng Liao , F. Manne, and A. N. Choudhary. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. In SC, page 62 , 2012 . M. M. A. Patwary, D. Palsetia, A. Agrawal, W. keng Liao, F. Manne, and A. N. Choudhary. A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. In SC, page 62, 2012."},{"key":"e_1_3_2_1_16_1","volume-title":"gamma-ray dbscan: a clustering algorithm applied to fermi-lat gamma-ray data. i. detection performances with real and simulated data","author":"Tramacere A.","year":"2012","unstructured":"A. Tramacere and C. Vecchio . gamma-ray dbscan: a clustering algorithm applied to fermi-lat gamma-ray data. i. detection performances with real and simulated data . 2012 . A. Tramacere and C. Vecchio. gamma-ray dbscan: a clustering algorithm applied to fermi-lat gamma-ray data. i. detection performances with real and simulated data. 2012."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553511"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760894.1760968"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/646418.693327"},{"issue":"3","key":"e_1_3_2_1_20_1","first-page":"73","article-title":"Using Anytime Algorithms","volume":"17","author":"Zilberstein S.","year":"1996","unstructured":"S. Zilberstein . Using Anytime Algorithms in Intelligent Systems. AI Magazine , 17 ( 3 ): 73 -- 83 , 1996 . S. Zilberstein. Using Anytime Algorithms in Intelligent Systems. AI Magazine, 17(3):73--83, 1996.","journal-title":"Intelligent Systems. AI Magazine"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Francisco California USA","acronym":"KDD '16","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 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939750","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:04Z","timestamp":1750223224000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939750"}},"subtitle":["An Efficient Anytime Density-based Clustering Algorithm for Very Large Complex Datasets"],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":19,"alternative-id":["10.1145\/2939672.2939750","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939750","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}