{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,6]],"date-time":"2026-09-06T18:10:15Z","timestamp":1788718215590,"version":"build-2803163510"},"reference-count":43,"publisher":"PeerJ","license":[{"start":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T00:00:00Z","timestamp":1710374400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"The National Research Foundation of Korea (NRF) grant funded by the Korean government","award":["NRF-2022R1F1A1074228"],"award-info":[{"award-number":["NRF-2022R1F1A1074228"]}]},{"name":"Institute of Information & communications Technology Planning & Evaluation (IITP) under the Artificial Intelligence Convergence Innovation Human Resources Development","award":["IITP-2023-RS-2023-00254592"],"award-info":[{"award-number":["IITP-2023-RS-2023-00254592"]}]},{"name":"The Korean government (MSIT) and the Dongguk University Research Fund of 2023"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>The density-based clustering method is considered a robust approach in unsupervised clustering technique due to its ability to identify outliers, form clusters of irregular shapes and automatically determine the number of clusters. These unique properties helped its pioneering algorithm, the Density-based Spatial Clustering on Applications with Noise (DBSCAN), become applicable in datasets where various number of clusters of different shapes and sizes could be detected without much interference from the user. However, the original algorithm exhibits limitations, especially towards its sensitivity on its user input parameters minPts and <jats:italic>\u025b<\/jats:italic>. Additionally, the algorithm assigned inconsistent cluster labels to data objects found in overlapping density regions of separate clusters, hence lowering its accuracy. To alleviate these specific problems and increase the clustering accuracy, we propose two methods that use the statistical data from a given dataset\u2019s k-nearest neighbor density distribution in order to determine the optimal <jats:italic>\u025b<\/jats:italic> values. Our approach removes the burden on the users, and automatically detects the clusters of a given dataset. Furthermore, a method to identify the accurate border objects of separate clusters is proposed and implemented to solve the unpredictability of the original algorithm. Finally, in our experiments, we show that our efficient re-implementation of the original algorithm to automatically cluster datasets and improve the clustering quality of adjoining cluster members provides increase in clustering accuracy and faster running times when compared to earlier approaches.<\/jats:p>","DOI":"10.7717\/peerj-cs.1921","type":"journal-article","created":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T09:30:33Z","timestamp":1710408633000},"page":"e1921","source":"Crossref","is-referenced-by-count":10,"title":["AutoSCAN: automatic detection of DBSCAN parameters and efficient clustering of data in overlapping density regions"],"prefix":"10.7717","volume":"10","author":[{"given":"Adil Abdu","family":"Bushra","sequence":"first","affiliation":[{"name":"Department of Multimedia Engineering, Dongguk University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongyeon","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Artificial Intelligence, Dongguk University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yejin","family":"Kan","sequence":"additional","affiliation":[{"name":"Department of Multimedia Engineering, Dongguk University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gangman","family":"Yi","sequence":"additional","affiliation":[{"name":"Department of Multimedia Engineering, Dongguk University, Seoul, South Korea"},{"name":"Department of Artificial Intelligence, Dongguk University, Seoul, South Korea"},{"name":"Division of AI Software Convergence, Dongguk University, Seoul, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"4443","published-online":{"date-parts":[[2024,3,14]]},"reference":[{"key":"10.7717\/peerj-cs.1921\/ref-1","doi-asserted-by":"publisher","DOI":"10.1201\/9781315373515","volume-title":"Data clustering: algorithms and applications","author":"Aggarwal","year":"2014","edition":"1"},{"issue":"2","key":"10.7717\/peerj-cs.1921\/ref-2","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/304181.304187","article-title":"OPTICS: ordering points to identify the clustering structure","volume":"28","author":"Ankerst","year":"1999","journal-title":"ACM Sigmod Record"},{"key":"10.7717\/peerj-cs.1921\/ref-3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-642-79999-0_1","article-title":"Advances in cluster analysis relevant to marketing research","volume-title":"From data to knowledge","author":"Arabie","year":"1996"},{"key":"10.7717\/peerj-cs.1921\/ref-4","volume-title":"Practical handbook of curve fitting","author":"Arlinghaus","year":"1994"},{"key":"10.7717\/peerj-cs.1921\/ref-5","article-title":"Survey of nearest neighbor techniques","author":"Bhatia","year":"2010"},{"key":"10.7717\/peerj-cs.1921\/ref-6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11704-019-9059-3","article-title":"A survey of density based clustering algorithms","volume":"15","author":"Bhattacharjee","year":"2021","journal-title":"Frontiers of Computer Science"},{"key":"10.7717\/peerj-cs.1921\/ref-7","volume-title":"Analyse math\u00e9matique sur les probabilit\u00e9s des erreurs de situation d\u2019un point","author":"Bravais","year":"1844"},{"key":"10.7717\/peerj-cs.1921\/ref-8","doi-asserted-by":"publisher","first-page":"87918","DOI":"10.1109\/ACCESS.2021.3089036","article-title":"Comparative analysis review of pioneering DBSCAN and successive density-based clustering algorithms","volume":"9","author":"Bushra","year":"2021","journal-title":"IEEE Access"},{"key":"10.7717\/peerj-cs.1921\/ref-9","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.ins.2023.02.088","article-title":"A review on semi-supervised clustering","volume":"632","author":"Cai","year":"2023","journal-title":"Information Sciences"},{"key":"10.7717\/peerj-cs.1921\/ref-10","doi-asserted-by":"publisher","first-page":"104824","DOI":"10.1016\/j.knosys.2019.06.032","article-title":"Fast density peak clustering for large scale data based on kNN","volume":"187","author":"Chen","year":"2020","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"10.7717\/peerj-cs.1921\/ref-11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0146-664X(80)90054-4","article-title":"Euclidean distance mapping","volume":"14","author":"Danielsson","year":"1980","journal-title":"Computer Graphics and Image Processing"},{"key":"10.7717\/peerj-cs.1921\/ref-12","article-title":"UCI machine learning repository, 2017","author":"Dua","year":"2019"},{"key":"10.7717\/peerj-cs.1921\/ref-13","first-page":"6","article-title":"Density-based spatial clustering of applications with noise","author":"Ester","year":"1996"},{"issue":"3","key":"10.7717\/peerj-cs.1921\/ref-14","first-page":"238","article-title":"Discriminatory analysis. nonparametric discrimination: consistency properties","volume":"57","author":"Fix","year":"1989","journal-title":"International Statistical Review\/Revue Internationale de Statistique"},{"key":"10.7717\/peerj-cs.1921\/ref-15","volume-title":"Data clustering: theory, algorithms, and applications","author":"Gan","year":"2020"},{"key":"10.7717\/peerj-cs.1921\/ref-16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/B978-0-12-079050-0.50011-4","article-title":"B-spline curves and surfaces","volume-title":"Computer aided geometric design","author":"Gordon","year":"1974"},{"key":"10.7717\/peerj-cs.1921\/ref-17","article-title":"HPDBSCAN Benchmark test files","author":"G\u00f6tz","year":"2015"},{"key":"10.7717\/peerj-cs.1921\/ref-18","volume-title":"Data mining: concepts and techniques","author":"Han","year":"2011"},{"issue":"1","key":"10.7717\/peerj-cs.1921\/ref-19","first-page":"100","article-title":"Algorithm AS 136: a k-means clustering algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"Journal of the Royal Statistical Society. Series C (Applied Statistics)"},{"key":"10.7717\/peerj-cs.1921\/ref-20","doi-asserted-by":"publisher","first-page":"107554","DOI":"10.1016\/j.patcog.2020.107554","article-title":"Density peak clustering based on relative density relationship","volume":"108","author":"Hou","year":"2020","journal-title":"Pattern Recognition"},{"issue":"1","key":"10.7717\/peerj-cs.1921\/ref-21","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF01908075","article-title":"Comparing partitions","volume":"2","author":"Hubert","year":"1985","journal-title":"Journal of Classification"},{"issue":"8","key":"10.7717\/peerj-cs.1921\/ref-22","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","article-title":"Data clustering: 50 years beyond K-means","volume":"31","author":"Jain","year":"2010","journal-title":"Pattern Recognition Letters"},{"key":"10.7717\/peerj-cs.1921\/ref-23","first-page":"246","article-title":"Density-connected subspace clustering for high-dimensional data","author":"Kailing","year":"2004"},{"key":"10.7717\/peerj-cs.1921\/ref-24","volume-title":"Curve fitting for programmable calculators","author":"Kolb","year":"1984"},{"issue":"3","key":"10.7717\/peerj-cs.1921\/ref-25","first-page":"231","article-title":"Density-based clustering","volume":"1","author":"Kriegel","year":"2011","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"10.7717\/peerj-cs.1921\/ref-26","first-page":"1","article-title":"VDBSCAN: varied density based spatial clustering of applications with noise","author":"Liu","year":"2007"},{"issue":"11","key":"10.7717\/peerj-cs.1921\/ref-27","doi-asserted-by":"publisher","first-page":"205","DOI":"10.21105\/joss.00205","article-title":"hdbscan: hierarchical density based clustering","volume":"2","author":"McInnes","year":"2017","journal-title":"Journal of Open Source Software"},{"issue":"8","key":"10.7717\/peerj-cs.1921\/ref-28","doi-asserted-by":"crossref","first-page":"3075","DOI":"10.1109\/TKDE.2019.2962412","article-title":"Efficient computation and visualization of multiple density-based clustering hierarchies","volume":"33","author":"Neto","year":"2019","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"6","key":"10.7717\/peerj-cs.1921\/ref-29","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/TKDE.2011.86","article-title":"Clustering with multiviewpoint-based similarity measure","volume":"24","author":"Nguyen","year":"2011","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"187","key":"10.7717\/peerj-cs.1921\/ref-30","first-page":"253","article-title":"VII. Mathematical contributions to the theory of evolution.\u2014III. Regression, heredity, and panmixia","author":"Pearson","year":"1896","journal-title":"Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character"},{"issue":"Oct","key":"10.7717\/peerj-cs.1921\/ref-31","first-page":"2825","article-title":"Scikit-learn: machine learning in Python","volume":"12","author":"Pedregosa","year":"2011","journal-title":"Journal of Machine Learning Research"},{"issue":"336","key":"10.7717\/peerj-cs.1921\/ref-32","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","article-title":"Objective criteria for the evaluation of clustering methods","volume":"66","author":"Rand","year":"1971","journal-title":"Journal of the American Statistical Association"},{"key":"10.7717\/peerj-cs.1921\/ref-33","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1201\/9781315373515-4","article-title":"A survey of partitional and hierarchical clustering algorithms","volume-title":"Data clustering: algorithms and applications","author":"Reddy","year":"2018"},{"issue":"6191","key":"10.7717\/peerj-cs.1921\/ref-34","doi-asserted-by":"publisher","first-page":"1492","DOI":"10.1126\/science.1242072","article-title":"Clustering by fast search and find of density peaks","volume":"344","author":"Rodriguez","year":"2014","journal-title":"Science"},{"key":"10.7717\/peerj-cs.1921\/ref-35","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1016\/j.neucom.2017.06.053","article-title":"A review of clustering techniques and developments","volume":"267","author":"Saxena","year":"2017","journal-title":"Neurocomputing"},{"issue":"3","key":"10.7717\/peerj-cs.1921\/ref-36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3068335","article-title":"DBSCAN revisited, revisited: why and how you should (still) use DBSCAN","volume":"42","author":"Schubert","year":"2017","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"10.7717\/peerj-cs.1921\/ref-37","first-page":"428","article-title":"Wavecluster: a multi-resolution clustering approach for very large spatial databases","volume":"98","author":"Sheikholeslami","year":"1998"},{"key":"10.7717\/peerj-cs.1921\/ref-38","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.neucom.2021.12.019","article-title":"Nearest neighbors-based adaptive density peaks clustering with optimized allocation strategy","volume":"473","author":"Sun","year":"2022","journal-title":"Neurocomputing"},{"key":"10.7717\/peerj-cs.1921\/ref-39","doi-asserted-by":"crossref","first-page":"105501","DOI":"10.1016\/j.dib.2020.105501","article-title":"Clustering benchmark datasets exploiting the fundamental clustering problems","volume":"30","author":"Thrun","year":"2020","journal-title":"Data in Brief"},{"key":"10.7717\/peerj-cs.1921\/ref-40","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.chemolab.2012.11.006","article-title":"Revised DBSCAN algorithm to cluster data with dense adjacent clusters","volume":"120","author":"Tran","year":"2013","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"10.7717\/peerj-cs.1921\/ref-41","first-page":"186","article-title":"STING: a statistical information grid approach to spatial data mining","volume":"97","author":"Wang","year":"1997"},{"key":"10.7717\/peerj-cs.1921\/ref-42","doi-asserted-by":"publisher","first-page":"10141","DOI":"10.1007\/s00521-021-05777-2","article-title":"Relative density-based clustering algorithm for identifying diverse density clusters effectively","volume":"33","author":"Wang","year":"2021","journal-title":"Neural Computing and Applications"},{"key":"10.7717\/peerj-cs.1921\/ref-43","first-page":"1960","article-title":"A novel clustering algorithm based on fitness proportionate sharing","author":"Yan","year":"2017"}],"container-title":["PeerJ Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/peerj.com\/articles\/cs-1921.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-1921.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-1921.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/peerj.com\/articles\/cs-1921.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T09:31:07Z","timestamp":1710408667000},"score":1,"resource":{"primary":{"URL":"https:\/\/peerj.com\/articles\/cs-1921"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,14]]},"references-count":43,"alternative-id":["10.7717\/peerj-cs.1921"],"URL":"https:\/\/doi.org\/10.7717\/peerj-cs.1921","archive":["CLOCKSS","LOCKSS","Portico"],"relation":{},"ISSN":["2376-5992"],"issn-type":[{"value":"2376-5992","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,14]]},"article-number":"e1921"}}