Fuzzy clustering using kernel method
Daoqiang Zhang, Songcan Chen · 2005
Classical fuzzy C-means (FCM) clustering is performed in the input space, given the desired number of clusters. Although it has proven effective for spherical data, it fails when the data structure of input patterns is non-spherical and complex. In this paper, we present a novel kernel-based fuzzy C-means clustering algorithm (KFCM). Its basic idea is to transform implicitly the input data into a higher dimensional feature space via a nonlinear map, which increases greatly possibility of linear separability of the patterns in the feature space, then perform FCM in the feature space. Another good attribute of KFCM is that it can automatically estimate the number of clusters in the dataset. The experimental results show that the proposed method has better performance in the Ring dataset. 1.