A dynamic core evolutionary clustering algorithm based on saturated memory

A dynamic core evolutionary clustering algorithm based on saturated memory

Abstract Because the number of clustering cores needs to be set before implementing the K-means algorithm, this type of algorithm often fails in applications with increasing data and changing distribution characteristics. This paper proposes an evolutionary algorithm DCC, which can dynamically adjus...

Full description

Bibliographic Details
Main Authors: Haibin Xie, Peng Li, Zhiyong Ding
Format: Article
Language:English
Published: Springer 2023-10-01
Series:Autonomous Intelligent Systems
Subjects:
Evolutionary clustering
Dynamic core
Memory saturation
Incremental clustering
Online Access:https://doi.org/10.1007/s43684-023-00055-5

Internet

https://doi.org/10.1007/s43684-023-00055-5

Similar Items