{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T01:41:40Z","timestamp":1785548500714,"version":"3.56.0"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,7,31]],"date-time":"2017-07-31T00:00:00Z","timestamp":1501459200000},"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":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2017,9,30]]},"abstract":"<jats:p>At SIGMOD 2015, an article was presented with the title \u201cDBSCAN Revisited: Mis-Claim, Un-Fixability, and Approximation\u201d that won the conference\u2019s best paper award. In this technical correspondence, we want to point out some inaccuracies in the way DBSCAN was represented, and why the criticism should have been directed at the assumption about the performance of spatial index structures such as R-trees and not at an algorithm that can use such indexes. We will also discuss the relationship of DBSCAN performance and the indexability of the dataset, and discuss some heuristics for choosing appropriate DBSCAN parameters. Some indicators of bad parameters will be proposed to help guide future users of this algorithm in choosing parameters such as to obtain both meaningful results and good performance. In new experiments, we show that the new SIGMOD 2015 methods do not appear to offer practical benefits if the DBSCAN parameters are well chosen and thus they are primarily of theoretical interest. In conclusion, the original DBSCAN algorithm with effective indexes and reasonably chosen parameter values performs competitively compared to the method proposed by Gan and Tao.<\/jats:p>","DOI":"10.1145\/3068335","type":"journal-article","created":{"date-parts":[[2017,8,1]],"date-time":"2017-08-01T19:20:44Z","timestamp":1501615244000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2534,"title":["DBSCAN Revisited, Revisited"],"prefix":"10.1145","volume":"42","author":[{"given":"Erich","family":"Schubert","sequence":"first","affiliation":[{"name":"Heidelberg University, Heidelberg, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00f6rg","family":"Sander","sequence":"additional","affiliation":[{"name":"University of Alberta, Edmonton, AB, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Ester","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, B.C. Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hans Peter","family":"Kriegel","sequence":"additional","affiliation":[{"name":"Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaowei","family":"Xu","sequence":"additional","affiliation":[{"name":"University of Arkansas at Little Rock, AR, U.S.A."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,7,31]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574698"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/VAST.2011.6102454"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304187"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007608"},{"key":"e_1_2_1_5_1","volume-title":"Mount","author":"Arya Sunil","year":"1993","unstructured":"Sunil Arya and David M . Mount . 1993 . Approximate nearest neighbor queries in fixed dimensions. In Proceedings of the 4th Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms (SODA). 271--280. Sunil Arya and David M. Mount. 1993. Approximate nearest neighbor queries in fixed dimensions. In Proceedings of the 4th Annual ACM\/SIGACT-SIAM Symposium on Discrete Algorithms (SODA). 271--280."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253263"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49257-7_15"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143857"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71618-1_82"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191880"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37456-2_14"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00234-2"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 7th Canadian Conference on Computational Geometry. 85--90","author":"Erickson Jeff","year":"1995","unstructured":"Jeff Erickson . 1995 . On the relative complexities of some geometric problems . In Proceedings of the 7th Canadian Conference on Computational Geometry. 85--90 . Jeff Erickson. 1995. On the relative complexities of some geometric problems. In Proceedings of the 7th Canadian Conference on Computational Geometry. 85--90."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 2nd ACM International Conference on Knowledge Discovery and Data Mining (KDD). 226--231","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , and Xiaowei Xu . 1996 . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the 2nd ACM International Conference on Knowledge Discovery and Data Mining (KDD). 226--231 . Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd ACM International Conference on Knowledge Discovery and Data Mining (KDD). 226--231."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/182591.182593"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737792"},{"key":"e_1_2_1_19_1","volume-title":"A faster algorithm for DBSCAN. Master\u2019s thesis","author":"Gunawan Ade","unstructured":"Ade Gunawan . 2013. A faster algorithm for DBSCAN. Master\u2019s thesis . Technical University of Eindhoven . http:\/\/repository.tue.nl\/760643. Ade Gunawan. 2013. A faster algorithm for DBSCAN. Master\u2019s thesis. Technical University of Eindhoven. http:\/\/repository.tue.nl\/760643."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_2_1_21_1","volume-title":"Data Mining: Concepts and Techniques","author":"Han Jiawei","year":"2011","unstructured":"Jiawei Han , Micheline Kamber , and Jian Pei . 2011 . Data Mining: Concepts and Techniques ( 3 rd ed.). Morgan Kaufmann . Jiawei Han, Micheline Kamber, and Jian Pei. 2011. Data Mining: Concepts and Techniques (3rd ed.). Morgan Kaufmann.","edition":"3"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263688"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 560--561","author":"Hildrum Kirsten","year":"2004","unstructured":"Kirsten Hildrum , John Kubiatowicz , Sean Ma , and Satish Rao . 2004 . A note on the nearest neighbor in growth-restricted metrics . In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 560--561 . Kirsten Hildrum, John Kubiatowicz, Sean Ma, and Satish Rao. 2004. A note on the nearest neighbor in growth-restricted metrics. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 560--561."},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 4th ACM International Conference on Knowledge Discovery and Data Mining (KDD). 58--65","author":"Hinneburg Alexander","unstructured":"Alexander Hinneburg and Daniel A. Keim . 1998. An efficient approach to clustering in large multimedia databases with noise . In Proceedings of the 4th ACM International Conference on Knowledge Discovery and Data Mining (KDD). 58--65 . Alexander Hinneburg and Daniel A. Keim. 1998. An efficient approach to clustering in large multimedia databases with noise. In Proceedings of the 4th ACM International Conference on Knowledge Discovery and Data Mining (KDD). 58--65."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13818-8_34"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510013"},{"key":"e_1_2_1_28_1","volume-title":"Lee","author":"Krauthgamer Robert","year":"2004","unstructured":"Robert Krauthgamer and James R . Lee . 2004 . Navigating nets: Simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 798--807. Robert Krauthgamer and James R. Lee. 2004. Navigating nets: Simple algorithms for proximity search. In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 798--807."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-016-1004-2"},{"key":"e_1_2_1_30_1","unstructured":"Moshe Lichman. 2013. UCI Machine Learning Repository. Retrieved from http:\/\/archive.ics.uci.edu\/ml.  Moshe Lichman. 2013. UCI Machine Learning Repository. Retrieved from http:\/\/archive.ics.uci.edu\/ml."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2008.4594646"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939750"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185370"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/197405.197408"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-62222-5_59"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISWC.2012.13"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/275487.275493"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009745219419"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824115"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2960717.2960729"},{"key":"e_1_2_1_43_1","volume-title":"Introduction to Data Mining","author":"Tan Pang-Ning","unstructured":"Pang-Ning Tan , Michael Steinbach , and Vipin Kumar . 2006. Introduction to Data Mining . Addison Wesley . Pang-Ning Tan, Michael Steinbach, and Vipin Kumar. 2006. Introduction to Data Mining. Addison Wesley."},{"key":"e_1_2_1_44_1","volume-title":"R: A Language and Environment for Statistical Computing","author":"Team R Core","year":"2015","unstructured":"R Core Team . 2015 . R: A Language and Environment for Statistical Computing . R Foundation for Statistical Computing. Retrieved from http:\/\/www.r-project.org\/. R Core Team. 2015. R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing. Retrieved from http:\/\/www.r-project.org\/."},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB). 186--195","author":"Wang Wei","unstructured":"Wei Wang , Jiong Yang , and Richard R. Muntz . 1997. STING: A statistical information grid approach to spatial data mining . In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB). 186--195 . Wei Wang, Jiong Yang, and Richard R. Muntz. 1997. STING: A statistical information grid approach to spatial data mining. In Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB). 186--195."},{"key":"e_1_2_1_46_1","volume-title":"Proceedings of the 24th International Conference on Very Large Data Bases (VLDB). 194--205","author":"Weber Roger","year":"1998","unstructured":"Roger Weber , Hans-J\u00f6rg Schek , and Stephen Blott . 1998 . A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces . In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB). 194--205 . Roger Weber, Hans-J\u00f6rg Schek, and Stephen Blott. 1998. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proceedings of the 24th International Conference on Very Large Data Bases (VLDB). 194--205."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11161"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3068335","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3068335","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:44Z","timestamp":1750215824000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3068335"}},"subtitle":["Why and How You Should (Still) Use DBSCAN"],"short-title":[],"issued":{"date-parts":[[2017,7,31]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9,30]]}},"alternative-id":["10.1145\/3068335"],"URL":"https:\/\/doi.org\/10.1145\/3068335","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,31]]},"assertion":[{"value":"2015-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}