Two Methods of Fuzzy c-Means and Classification Functions
A regularization method using an entropy function is studied and contrasted with the ordinary fuzzy c-means. The way in which two algorithms lead to similar formulas is discussed. Classification functions derived from the two methods, which are naturally obtained when the algorithm of clustering is convergent, are compared. Theoretical properties of the two classification functions are studied.
KeywordsFuzzy c-means Regularization Entropy Classification Rule
Unable to display preview. Download preview PDF.
- Bezdek, J.C. (1981). Pattern Recognition with Fuzzy Objective Function Algorithms. Plenum.Google Scholar
- Li, R.-P. and Mukaidono, M. (1995). A maximum entropy approach to fuzzy clustering, Proc. of the 4th IEEE Intern. Conf on Fuzzy Systems (FUZZ- IEEE/IFES’95), Yokohama, Japan, March 20-24, 1995, 2227–2232.Google Scholar
- Keller, J.M., Gray, M.R., and Givens, J.A. (1985). A fuzzy k - nearest neighbor algorithm, IEEE Trans., on Syst., Man, and Cybern., 15, 580–585.Google Scholar
- Masulli, F., Artuso, M., Bogus, P., and Schenone, A. (1997). Fuzzy clustering methods for the segmentation of multivariate medical images, Proc. of the 7th International Fuzzy Systems Association World Congress (IFSA;91% June 25-30, 1997, Prague, Chech, 123–128.Google Scholar
- Preparata, F.P. and Shamos, M.I. (1985). Computational Geometry: An Introduction, Springer, New York.Google Scholar