A dynamic core evolutionary clustering algorithm based on saturated memory

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 adjust the number of clustering cores with data change. DCC algorithm uses the Gaussian function as the activation function of each core. Each clustering core can adjust its center vector and coverage based on the response to the input data and its memory state to better fit the sample clusters in the space. The DCC algorithm model can evolve from 0. After each new sample is added, the winning dynamic core can be adjusted or split by competitive learning, so that the number of clustering cores of the algorithm always maintains a better adaptation relationship with the existing data. Furthermore, because its clustering core can split, it can subdivide the densely distributed data clusters. Finally, detailed experimental results show that the evolutionary clustering algorithm DCC based on the dynamic core method has excellent clustering performance and strong robustness.