K-means (or called hard c-means, HCM) and fuzzy c-means (FCM) are the most known clustering algorithms. However, the HCM and FCM algorithms work worse for the data set with different shape clusters in noisy environments. For solving these drawbacks in HCM and FCM, Wu and Yang (2002) proposed alternative c-means clustering that extends HCM and FCM into alternative HCM (AHCM) and alternative FCM (AFCM). In this paper, we further extend AHCM and AFCM as Gaussian-kernel c-means clustering, called GK-HCM and GK-FCM. Some numerical and real data sets are used to compare the proposed GK-HCM and GK-FCM with AHCM and AFCM methods. Experimental results and comparisons actually demonstrate these good aspects of the proposed GK-HCM and GK-FCM algorithms with its effectiveness and usefulness in practice.
Chen, S.C., Zhang, D.Q.: Robust image segmentation using FCM with spatial constrains based on new kernel-induced distance measure. IEEE Trans. Syst. Man Cybern. -B 34, 1907–1916 (2004)CrossRefGoogle Scholar
Dembélé, D., Kastner, P.: Fuzzy c-means method for clustering microarray data. Bioinformatics 19, 973–980 (2003)CrossRefGoogle Scholar
Dunn, J.C.: A fuzzy relative of the ISODATA process and its use in detecting compact, well-separated clusters. J. Cybern. 3, 32–57 (1974)MathSciNetCrossRefGoogle Scholar