Initial clustering center optimization and feature auto-weighting for k-Means clustering algorithm

We focus on two main issues. First, the effectiveness of clustering is strongly related to selecting the initial clustering center. Traditional algorithms and their tendency to select multiple initial clustering centers in the same cluster, we use the maximum distance principle, which ensures the initial clustering centers attribute to different categories to avoid this problem. Second, the k-means algorithm cannot assign greater weights to essential features in high dimensions because it treats all features equitably in the clustering process. We acquire a proposed algorithm that is more efficient and accurate than the traditional k-means by improving the algorithm with the multidimensional feature weights technique to give more weight to the more essential features. Experimentally, our enhancements have significantly improved efficiency by 33% and accuracy by 36%.