Adaptive Density Spatial Clustering Method Fusing Chameleon Swarm Algorithm

The density-based spatial clustering of application with noise (DBSCAN) algorithm is able to cluster arbitrarily structured datasets. However, the clustering result of this algorithm is exceptionally sensitive to the neighborhood radius (Eps) and noise points, and it is hard to obtain the best result quickly and accurately with it. To solve the above problems, we propose an adaptive DBSCAN method based on the chameleon swarm algorithm (CSA-DBSCAN). First, we take the clustering evaluation index of the DBSCNA algorithm as the objective function and use the chameleon swarm algorithm (CSA) to iteratively optimize the evaluation index value of the DBSCAN algorithm to obtain the best Eps value and clustering result. Then, we introduce the theory of deviation in the data point spatial distance of the nearest neighbor search mechanism to assign the identified noise points, which solves the problem of over-identification of the algorithm noise points. Finally, we construct color image superpixel information to improve the CSA-DBSCAN algorithm's performance regarding image segmentation. The simulation results of synthetic datasets, real-world datasets, and color images show that the CSA-DBSCAN algorithm can quickly find accurate clustering results and segment color images effectively. The CSA-DBSCAN algorithm has certain clustering effectiveness and practicality.

Automated summary

The DBSCAN algorithm is sensitive to the neighborhood radius and noise points, making it difficult to quickly obtain accurate results. To address this, we propose an adaptive DBSCAN method using the chameleon swarm algorithm. By iteratively optimizing the evaluation index of DBSCAN, we can find the best neighborhood radius and clustering result. Additionally, the algorithm solves the problem of over-identification of noise points by utilizing the theory of deviation in nearest neighbor searches.