Fuzzy c-Means Clustering Using Transformations into High Dimensional Spaces

Algorithms of fuzzy -means clustering with kernels employed in nonlinear transformations into high dimensional spaces in the support vector machines are studied. The objective functions in the standard method and the entropy based method are considered and iterative solutions in the alternate optimization algorithm are derived. Explicit cluster centers in the data space are not obtained by this method in general but fuzzy classification functions are useful which have much more information than crisp clusters in the hard -means. Numerical examples using radial basis kernel functions are given.

[1]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[2]  James M. Keller,et al.  A possibilistic approach to clustering , 1993, IEEE Trans. Fuzzy Syst..

[3]  Vladimir Vapnik,et al.  Statistical learning theory , 1998 .

[4]  J. C. Dunn,et al.  A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters , 1973 .

[5]  Teuvo Kohonen,et al.  Self-Organization and Associative Memory, Third Edition , 1989, Springer Series in Information Sciences.

[6]  Hava T. Siegelmann,et al.  A support vector clustering method , 2000, Proceedings 15th International Conference on Pattern Recognition. ICPR-2000.

[7]  Sadaaki Miyamoto,et al.  Methods in Hard and Fuzzy Clustering , 2000 .

[8]  Mark A. Girolami,et al.  Mercer kernel-based clustering in feature space , 2002, IEEE Trans. Neural Networks.

[9]  Rui-Ping Li,et al.  A maximum-entropy approach to fuzzy clustering , 1995, Proceedings of 1995 IEEE International Conference on Fuzzy Systems..