4.7 Article

Collaborative annealing power k-means plus plus clustering

期刊

KNOWLEDGE-BASED SYSTEMS
卷 255, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.knosys.2022.109593

关键词

k-means clustering; k-means plus plus; Power k-means; Collaborative neurodynamic optimization

资金

  1. Research Grants Council of the Hong Kong Special Administrative Region of China [11202318, 11202019, 11203721]
  2. InnoHK initiative, Hong Kong
  3. Government of the Hong Kong Special Administrative Region, Hong Kong
  4. Laboratory for AI-Powered Financial Technologies, Hong Kong

向作者/读者索取更多资源

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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据