An efficient DBSCAN optimized by arithmetic optimization algorithm with opposition-based learning
Journal article
Yang, Yang, Qian, Chen, Li, Haomiao, Gao, Yuchao, Wu, Jinran, Liu, Chan-Juan and Zhao, Shangrui. (2022). An efficient DBSCAN optimized by arithmetic optimization algorithm with opposition-based learning. Journal of Supercomputing. 78(18), pp. 19566-19604. https://doi.org/10.1007/s11227-022-04634-w
Authors | Yang, Yang, Qian, Chen, Li, Haomiao, Gao, Yuchao, Wu, Jinran, Liu, Chan-Juan and Zhao, Shangrui |
---|---|
Abstract | As unsupervised learning algorithm, clustering algorithm is widely used in data processing field. Density-based spatial clustering of applications with noise algorithm (DBSCAN), as a common unsupervised learning algorithm, can achieve clusters via finding high-density areas separated by low-density areas based on cluster density. Different from other clustering methods, DBSCAN can work well for any shape clusters in the spatial database and can effectively cluster exceptional data. However, in the employment of DBSCAN, the parameters, EPS and MinPts, need to be preset for different clustering object, which greatly influences the performance of the DBSCAN. To achieve automatic optimization of parameters and improve the performance of DBSCAN, we proposed an improved DBSCAN optimized by arithmetic optimization algorithm (AOA) with opposition-based learning (OBL) named OBLAOA-DBSCAN. In details, the reverse search capability of OBL is added to AOA for obtaining proper parameters for DBSCAN, to achieve adaptive parameter optimization. In addition, our proposed OBLAOA optimizer is compared with standard AOA and several latest meta heuristic algorithms based on 8 benchmark functions from CEC2021, which validates the exploration improvement of OBL. To validate the clustering performance of the OBLAOA-DBSCAN, 5 classical clustering methods with 10 real datasets are chosen as the compare models according to the computational cost and accuracy. Based on the experimental results, we can obtain two conclusions: (1) the proposed OBLAOA-DBSCAN can provide highly accurately clusters more efficiently; and (2) the OBLAOA can significantly improve the exploration ability, which can provide better optimal parameters. |
Keywords | clustering; hyperparameter optimization; swarm intelligence; exploration |
Year | 2022 |
Journal | Journal of Supercomputing |
Journal citation | 78 (18), pp. 19566-19604 |
Publisher | Springer |
ISSN | 0920-8542 |
Digital Object Identifier (DOI) | https://doi.org/10.1007/s11227-022-04634-w |
Scopus EID | 2-s2.0-85132826921 |
Open access | Published as ‘gold’ (paid) open access |
Page range | 19566-19604 |
Publisher's version | License File Access Level Open |
Output status | Published |
Publication dates | |
Online | 26 Jun 2022 |
Publication process dates | |
Accepted | 26 May 2022 |
Deposited | 05 Jul 2023 |
https://acuresearchbank.acu.edu.au/item/8z3vz/an-efficient-dbscan-optimized-by-arithmetic-optimization-algorithm-with-opposition-based-learning
Download files
Publisher's version
OA_Yang_2022_An_efficient_DBSCAN_optimized_by_arithmetic.pdf | |
License: CC BY 4.0 | |
File access level: Open |
58
total views29
total downloads1
views this month0
downloads this month