Collaborative annealing power k-means++ clustering
作者:
Highlights:
•
摘要
Clustering is the most fundamental technique for data processing. This paper presents a collaborative annealing power k-means++ clustering algorithm by integrating the k-means++ and power k-means algorithms in a collaborative neurodynamic optimization framework. The proposed algorithm starts with k-means++ to select initial cluster centers, then leverages the power k-means to find multiple sets of centers as alternatives and a particle swarm optimization rule to reinitialize the centers in the subsequential iterations for improving clustering performance. Experimental results on twelve benchmark datasets are elaborated to demonstrate the superior performance of the proposed algorithm to seven mainstream clustering algorithms in terms of 21 internal and external indices.
论文关键词:k-means clustering,k-means++,Power k-means,Collaborative neurodynamic optimization
论文评审过程:Received 31 May 2022, Revised 5 July 2022, Accepted 30 July 2022, Available online 24 August 2022, Version of Record 5 September 2022.
论文官网地址:https://doi.org/10.1016/j.knosys.2022.109593