Journal
KNOWLEDGE-BASED SYSTEMS
Volume 255, Issue -, Pages -Publisher
ELSEVIER
DOI: 10.1016/j.knosys.2022.109593
Keywords
k-means clustering; k-means plus plus; Power k-means; Collaborative neurodynamic optimization
Categories
Funding
- Research Grants Council of the Hong Kong Special Administrative Region of China [11202318, 11202019, 11203721]
- InnoHK initiative, Hong Kong
- Government of the Hong Kong Special Administrative Region, Hong Kong
- Laboratory for AI-Powered Financial Technologies, Hong Kong
Ask authors/readers for more resources
This paper presents a collaborative annealing power k-means++ clustering algorithm, which integrates the k-means++ and power k-means algorithms in a collaborative neurodynamic optimization framework to select initial cluster centers and improve clustering performance.
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. (c) 2022 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available