Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Improvement of the PFCM(Possibilistic Fuzzy C-Means) Clustering Method

PFCM 클러스터링 기법의 개선

  • Published : 2009.01.30
Download PDF
⟨ Previous Next ⟩

Abstract

Cluster analysis or clustering is a kind of unsupervised learning method in which a set of data points is divided into a given number of homogeneous groups. Fuzzy clustering method, one of the most popular clustering method, allows a point to belong to all the clusters with different degrees, so produces more intuitive and natural clusters than hard clustering method does. Even more some of fuzzy clustering variants have noise-immunity. In this paper, we improved the Possibilistic Fuzzy C-Means (PFCM), which generates a membership matrix as well as a typicality matrix, using Gath-Geva (GG) method. The proposed method has a focus on the boundaries of clusters, which is different from most of the other methods having a focus on the centers of clusters. The generated membership values are suitable for the classification-type applications. As the typicality values generated from the algorithm have a similar distribution with the values of density function of Gaussian distribution, it is useful for Gaussian-type density estimation. Even more GG method can handle the clusters having different numbers of data points, which the other well-known method by Gustafson and Kessel can not. All of these points are obvious in the experimental results.

클러스터링은 주어진 데이터 포인트들을 주어진 개수의 그룹으로 나누는 비지도 학습의 한 방법이다. 클러스터링의 방법 중 하나로 널리 알려진 퍼지 클러스터링은 하나의 포인트가 모든 클러스터에 서로 다른 정도로 소속될 수 있도록 함으로써 하나의 클러스터에만 속할 수 있도록 하는 K-means와 같은 방법에 비해 자연스러운 클러스터 형태의 유추가 가능하고, 잡음에 강한 장점이 있다. 이 논문에서는 기존의 퍼지 클러스터링 방법 중 소속도(membership)와 전형성(typicality)을 동시에 계산해 낼 수 있는 Possibilistic Fuzzy C-Means(PFCM) 방법에 Gath-Geva(CG)의 방법을 적용하여 PFCM을 개선한다. 제안한 방법은 PFCM 장점을 그대로 가지면서도, GG의 거리 척도에 의해 클러스터들 사이의 경계를 강조함으로써 분류 목적에 적합한 소속도를 계산할 수 있으며 전형성은 가우스 형태의 분포에서 생성된 포인트들의 분포 함수를 정확하게 모사함으로써 확률 밀도 추정의 방법으로도 사용될 수 있다. 또한 GG 방법은 Gustafson-Kessel 방법과 달리 클러스터에 포함된 포인트의 개수가 확연히 차이나는 경우에도 정확한 결과를 얻을 수 있다. 이러한 사실들은 실험 결과를 통해 확인할 수 있다.

Keywords

References

  1. L. A. Zadeh, "Fuzzy sets," Information and Control Vol.8, No.3, pp. 338-353, 1965 https://doi.org/10.1016/S0019-9958(65)90241-X
  2. E. H. Ruspini, "A new approach to clustering," Information and Control 16, pp. 22-32, 1969
  3. Rui Xu and Donald Wunsch II, "Survey of Clustering Algorithms," IEEE Transactions on Neural Networks, Vol.16, No.3, pp. 645-678, 2005 https://doi.org/10.1109/TNN.2005.845141
  4. J. C. Dunn, "A fuzzy relative of the ISODATA process and its use in detecting compact well separated clusters," Journal of Cybernetics 3, pp. 32-57, 1974 https://doi.org/10.1080/01969727308546046
  5. J. C. Bezdek, Pattern Recognition with Fuzzy Objective Function Algorithms, Plenum, New York, 1981
  6. R. Krishnapuram and J. M. Keller, "A Possibilistic Approach to Clustering," IEEE Transactions on Fuzzy Systems Vol.1, No.2, pp. 98-110, 1993 https://doi.org/10.1109/91.227387
  7. R. Krishnapuram and J. M. Keller, "The Possibilistic C-Means Algorithm: Insights and Recommendations," IEEE Transactions on Fuzzy Systems Vol.4, No.3, pp. 385-393, 1996 https://doi.org/10.1109/91.531779
  8. N. R. Pal, K. Pal, J. M. Keller and J. C. Bezdek, "A Possibilistic Fuzzy c-Means Clustering Algorithm," IEEE Transactions on Fuzzy Systems Vol.13, No.4, pp. 517-530, 2005 https://doi.org/10.1109/TFUZZ.2004.840099
  9. D. E. Gustafson and W. C. Keller, "Fuzzy clustering with a fuzzy covariance matrix," Proceedings of the 1978 IEEE Conference on Decision and Control, pp. 761-766, 1979
  10. R. Babuska, P. J. van der Veen and U. Kaymak, "Improved Covariance Estimation for Gustafson- Kessel Clustering," Proceedings of the 2002 IEEE International Conference on Fuzzy Systems, pp. 1081-1085, 2002
  11. I. Gath and A.B. Geva, "Unsupervised Fuzzy Clustering," IEEE Transactions on Pattern Analysis and Machine Intelligence Vol.11, No.7, pp. 773-781, 1989 https://doi.org/10.1109/34.192473
  12. B. Ojeda-Magana, R. Ruelas, M. A. Corona-Nakamura and D. Andina, "An Improvement to the Possibilistic Fuzzy C-Means Clustering Algorithm," World Automation Congress 2006 (WAC '06), pp. 1-8, 2006
  13. N. R. Pal, K. Pal and J. C. Bezdek, "A mixed c-means clustering model," Proceedings of IEEE International Conference on Fuzzy Systems, pp. 11-21, 1997
  14. J. S. Zhand and Y. W. Leung, "Improved Possibilistic C-Means Clustering Algorithms," IEEE Transactions on Fuzzy Systems Vol.12, No.2, pp. 209-217, 2004 https://doi.org/10.1109/TFUZZ.2004.825079
  15. D. Tran and M. Wagner, "Fuzzy Entropy Clustering," Proceedings of the 9th IEEE International Conference on Fuzzy Systems, pp.152-157, 2000