AutoSCAN: automatic detection of DBSCAN parameters and efficient clustering of data in overlapping density regions
PeerJ Computer Science · 14.03.2024 · 10 · e1921
DOI: 10.7717/peerj-cs.1921 ↗Kurz gefasst
Fachartikel in der Zeitschrift PeerJ Computer Science, online erschienen am 14.03.2024. Verfasst von Adil Abdu Bushra und 3 weiteren Autor:innen. Beteiligte Einrichtung: Department of Multimedia Engineering, Dongguk University, Seoul, South Korea. Die Arbeit wurde bisher 11-mal zitiert (Crossref) und nennt 43 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: The National Research Foundation of Korea (NRF) grant funded by the Korean government, Institute of Information & communications Technology Planning & Evaluation (IITP) under the Artificial Intelligence Convergence Innovation Human Resources Deve…, The Korean government (MSIT) and the Dongguk University Research Fund of 2023.
Abstract (Originalsprache)
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 ɛ . 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’s k-nearest neighbor density distribution in order to determine the optimal ɛ 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.
Schlagwörter
Stichwörter der Autor:innen
Autor:innen und Institutionen
- Department of Multimedia Engineering, Dongguk University, Seoul, South Korea.
- Department of Artificial Intelligence, Dongguk University, Seoul, South Korea.
- Division of AI Software Convergence, Dongguk University, Seoul, South Korea.
Förderung
- The National Research Foundation of Korea (NRF) grant funded by the Korean government
- Institute of Information & communications Technology Planning & Evaluation (IITP) under the Artificial Intelligence Convergence Innovation Human Resources Deve…
- The Korean government (MSIT) and the Dongguk University Research Fund of 2023
Zitieren
APA
Bushra, A. A., Kim, D., Kan, Y., & Yi, G. (2024). AutoSCAN: automatic detection of DBSCAN parameters and efficient clustering of data in overlapping density regions. PeerJ Computer Science, 10, e1921. https://doi.org/10.7717/peerj-cs.1921
Vancouver
Bushra AA, Kim D, Kan Y, Yi G. AutoSCAN: automatic detection of DBSCAN parameters and efficient clustering of data in overlapping density regions. PeerJ Computer Science. 2024;10:e1921. doi:10.7717/peerj-cs.1921
BibTeX
@article{Bushra2024,
author = {Bushra, Adil Abdu and Kim, Dongyeon and Kan, Yejin and Yi, Gangman},
title = {AutoSCAN: automatic detection of DBSCAN parameters and efficient clustering of data in overlapping density regions},
journal = {PeerJ Computer Science},
year = {2024},
volume = {10},
pages = {e1921},
doi = {10.7717/peerj-cs.1921}
}
EUVIMED