Affiliations:
School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan, China
Correspondence:
[*]
Corresponding author. Hang Zhang, School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, Henan, China. Tel.: 15539171886; E-mail: [email protected].
Abstract: The density peak clustering algorithm (DPC) quickly divides each cluster based on high-density peak points and shows better clustering performance. In order to address the issue that the local density is constrained by the preset cut-off distance in DPC and the Euclidean distance cannot capture the possible correlation between different features, a DPC algorithm based on improved dung beetle optimization (IDBO) and Mahalanobis metric is proposed, called IDBO-MDDPC. The IDBO algorithm enhances the ball dung beetle individual by incorporating nonlinear dynamic factors to increase the search and development capabilities of the algorithm and by incorporating an adaptive cosine wave inertial weight strategy to more precisely determine the optimal position of the thief dung beetle in order to improve the convergence speed and accuracy of the algorithm. The IDBO algorithm is simulated on eight benchmark functions, and the results demonstrate that it is superior to other comparison algorithms in terms of convergence speed and accuracy. In the DPC algorithm, the Mahalanobis metric is used to capture the correlation between features to improve clustering performance. The IDBO algorithm is integrated with the DPC algorithm, and the F-Measure evaluation index is used to design the objective function so that the optimal value of the cut-off distance can be automatically selected. In order to evaluate the efficiency of the algorithm, three sets of artificially synthesized datasets and five sets of UCI standard datasets were chosen for studies. Experimental results show that the IDBO-MDDPC algorithm can automatically determine a better cut-off distance value and ensure higher clustering accuracy.
