K-Means Clustering Sorting Algorithm Optimized by SSA Based on Emitter PDW
In order to solve the problem that the initial K value of K-Means clustering algorithm needs to be given in advance and the division needs to be determined according to the initial clustering center, which is not conducive to practical application, a SSA optimized K-Means clustering sorting algorithm based on emitter PDW is proposed, which belongs to the unsupervised type according to emitter PDW data sorting. The Initial clustering center is optimized quickly by using the Silhouette Coefficient of internal evaluation index combined with the better global search and local development ability of SSA sparrow search algorithm through traversing a certain range of K values to find the optimal Silhouette Coefficient of internal evaluation index. Therefore, the K-Means algorithm is optimized without parameters, and then the K-Means algorithm is used for clustering. The proposed clustering sorting algorithm is verified by simulation data, and it has high correctness for the clustering effect in the presence of interference.
Authors
- S. Y. Xiao (ORCID: https://orcid.org/0000-0001-6438-0282)
- Chao Wang (ORCID: https://orcid.org/0000-0001-7930-3642)
- Zhenan Bao (ORCID: https://orcid.org/0000-0002-0972-1715)
- Kai Wang (ORCID: https://orcid.org/0000-0002-7870-9998)
- Xiang Chen
Institutions
- Air Force Engineering University (CN)
- Xi’an University of Posts and Telecommunications (CN)
Publication Details
- Published
- 2025-03-21
- DOI
- https://doi.org/10.1109/icaace65325.2025.11019216
- Primary Topic
- Advanced Algorithms and Applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00