Bushra Adil Abdu, Kim Dongyeon, Kan Yejin, Yi Gangman
Department of Multimedia Engineering, Dongguk University, Seoul, South Korea.
Department of Artificial Intelligence, Dongguk University, Seoul, South Korea.
PeerJ Comput Sci. 2024 Mar 14;10:e1921. doi: 10.7717/peerj-cs.1921. eCollection 2024.
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.
基于密度的聚类方法在无监督聚类技术中被认为是一种强大的方法,因为它能够识别异常值、形成不规则形状的聚类并自动确定聚类的数量。这些独特的特性有助于其开创性算法——带噪声的基于密度的空间聚类应用(DBSCAN)——适用于各种数据集,在这些数据集中,可以检测到不同形状和大小的各种数量的聚类,而无需用户过多干预。然而,原始算法存在局限性,特别是对用户输入参数minPts和 的敏感性。此外,该算法为在单独聚类的重叠密度区域中发现的数据对象分配了不一致的聚类标签,从而降低了其准确性。为了缓解这些特定问题并提高聚类准确性,我们提出了两种方法,这些方法使用给定数据集的k近邻密度分布的统计数据来确定最佳 值。我们的方法减轻了用户的负担,并自动检测给定数据集的聚类。此外,还提出并实现了一种识别单独聚类的准确边界对象的方法,以解决原始算法的不可预测性。最后,在我们的实验中,我们表明,与早期方法相比,我们对原始算法的高效重新实现能够自动对数据集进行聚类并提高相邻聚类成员的聚类质量,从而提高聚类准确性并加快运行时间。