Collaborative annealing power k-means++ clustering

Hongzong Li, Jun Wang*

*Corresponding author for this work

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

48 Citations (Scopus)

Abstract

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.
Original languageEnglish
Article number109593
JournalKnowledge-Based Systems
Volume255
Online published24 Aug 2022
DOIs
Publication statusPublished - 14 Nov 2022

Funding

This work was supported in part by the Research Grants Council of the Hong Kong Special Administrative Region of China under Grants 11202318, 11202019, and 11203721; and in part by the InnoHK initiative, Hong Kong, the Government of the Hong Kong Special Administrative Region, Hong Kong, and Laboratory for AI-Powered Financial Technologies, Hong Kong .

Research Keywords

  • Collaborative neurodynamic optimization
  • k-means clustering
  • k-means++
  • Power k-means

Fingerprint

Dive into the research topics of 'Collaborative annealing power k-means++ clustering'. Together they form a unique fingerprint.

Cite this