A dynamic fuzzy clustering algorithm based on kernel methods

A new dynamic fuzzy clustering algorithm is proposed. By using kernel methods, we can map the data in the original space into a high-dimensional feature space in which a fuzzy dissimilarity matrix is constructed. It not only accurately reflects the difference of attributes among classes, but also maps the difference among samples in the high-dimensional feature space into the two-dimensional plane. Using the particularity of strong global search ability and quickly converging speed of Particle Swarm Optimization (PSO) algorithms, it optimizes the coordinates of the samples distributed randomly on a plane. The clustering for random distributing shapes of samples is realized. It not only overcomes the dependence of clustering validity on the space distribution of samples, but also improves the flexibility of the clustering and the visualization of high-dimensional samples. Numerical experiments show the effectiveness of the proposed algorithm.