single-jc.php

JACIII Vol.11 No.8 pp. 897-904
doi: 10.20965/jaciii.2007.p0897
(2007)

Paper:

Fuzzy Clustering Based on Total Uncertainty Degree

Tomohito Esaki*, Tomonori Hashiyama**,
and Yahachiro Tsukamoto***

*The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu 182-8585, Japan

**Grad. School of Information Systems, The University of Electro-Communications, 1-5-1 Chofugaoka, Chofu 182-8585, Japan

***Dept. of Information Engineering, Faculty of Science and Technology, Meijo University, 1-501 Shiogamaguchi, Tempaku-ku, Nagoya 468-8502, Japan

Received:
March 15, 2007
Accepted:
May 23, 2007
Published:
October 20, 2007
Keywords:
fuzzy clustering, possibilistic clustering, Dempster-Shafer theory, total uncertainty degree
Abstract

Traditional Fuzzy c-Means (FCM) methods have probabilistic and additive restrictions that ∑ μ (x) = 1; the sum of membership values on the identified membership function is one. Possibilistic clustering methods identify membership functions without such constraints, but some parameters used in objective functions are difficult to understand and membership function shapes are independent of clusters estimated through possibilistic methods. We propose novel fuzzy clustering using a total uncertainty degree based on evidential theory with which we obtain nonadditive membership functions whose their shapes depend on data distribution, i.e., they mutually differ. Cluster meanings thus become easier to understand than in possibilistic methods and our proposal requires only one parameter “fuzzifier.” Numerical experiments demonstrated the feasibility of our proposal conducted.

Cite this article as:
Tomohito Esaki, Tomonori Hashiyama, and
and Yahachiro Tsukamoto, “Fuzzy Clustering Based on Total Uncertainty Degree,” J. Adv. Comput. Intell. Intell. Inform., Vol.11, No.8, pp. 897-904, 2007.
Data files:
References
  1. [1] S. Miyamoto, K. Umayahara, and M. Mukaidono, “Fuzzy Classification Function in the Methods of Fuzzy c-Means and Regularization by Entropy,” Journal of Japan Society for Fuzzy Theory and Systems, Vol.10, No.3, pp. 156-164, 1998 (in Japanese).
  2. [2] K. Miyagishi, H. Ichihashi, and K. Honda, “Fuzzy c-Means Clustering with Regularization by K-L Information,” Journal of Japan Society for Fuzzy Theory and Systems, Vol.13, No.4, pp. 406-417, 2001 (in Japanese).
  3. [3] M. Yasuda, T. Furuhashi, M. Matsuzaki, and S. Okuma, “Fuzzy Clustering Using Fuzzy Entropy and Heuristic Search,” Journal of Japan Society for Fuzzy Theory and Systems, Vol.13, No.4, pp. 387-396, 2001 (in Japanese).
  4. [4] R. Krishnapuram and J. M. Keller, “A possibilistic approach to clustering,” IEEE Trans. on Fuzzy Syst., Vol.1, No.2, pp. 98-110, 1993.
  5. [5] K. Shibuya, S. Miyamoto, O. Takata, and K. Umayahara, “Regularization and Constraints in Fuzzy c-Means and Possibilistic Clustering,” Journal of Japan Society for Fuzzy Theory and Systems, Vol.13, No.4, pp. 707-715, 2001 (in Japanese).
  6. [6] N. R. Pal, K. Pal, J. M. Keller, and J. C. Bezdek, “A Possibilistic Fuzzy c-Means Clustering Algorithm,” IEEE Trans. on Fuzzy Syst., Vol.13, No.4, pp. 517-530, 2005.
  7. [7] T. Esaki, T. Hashiyama, and Y. Tsukamoto, “Fuzzy c-Means Clustering with Regularization by Confusion Degree,” Journal of Japan Society for Fuzzy Theory and Intelligent Informatics, Vol.18, No.4, pp. 105-114, 2006 (in Japanese).
  8. [8] G. A. Shafer, “Mathematical Theory of Evidence,” Princeton Univ. Press, Princeton, N. J., 1976.
  9. [9] G. J. Klir and T. A. Folger, “Fuzzy Sets, Uncertainty and Information,” Prentice-Hall: Englewood Cliffs, N. J., 1988.
  10. [10] Y. Tsukamoto, “Three Types of Entropy in the Evidential Theory with their Applications,” The Fourth Asian Fuzzy System Symposium, pp. 645-650, 2000.

*This site is desgined based on HTML5 and CSS3 for modern browsers, e.g. Chrome, Firefox, Safari, Edge, Opera.

Last updated on May. 14, 2021