|
||||||||||||||
Plenary Lecture On Robust Possibilistic C-Means Clustering Algorithm
Professor
Miin-Shen Yang Abstract: Clustering is a method for finding clusters of a data set with the most similarity within the same cluster and the most dissimilarity between different clusters. It is a branch in multivariate statistical analysis and an unsupervised learning in pattern recognition. Since 1970, the fuzzy c-means (FCM) clustering algorithm has been well used in various applications. It is known that the robustness is important for clustering. However, the robustness for FCM is not enough. A first extension of FCM based on possibilistic c-partitions was the possibilistic c-means (PCM) clustering algorithm proposed by Krishnapuram and Keller in 1993. In this lecture, I will introduce a robust type of PCM. Since a merit of PCM is as a good mode-seeking algorithm if initials and parameters are suitably chosen, however, the performance of PCM heavily depends on initializations and parameters selection. In the robust PCM, we propose a mechanism of robust automatic merging. The proposed robust PCM algorithm first uses all data points as initial cluster centers and then automatically merges these surrounding points around each cluster mode such that it can self-organize data groups according to the original data structure. The robust PCM can exhibit the robustness to parameter, noise, cluster number, different volumes and initializations. Some numerical data and real data sets are used to show these good aspects of the robust PCM. Experimental results and comparisons actually demonstrate that the proposed robust PCM is an effective and parameter-free robust clustering algorithm.
Brief Biography of the Speaker: |
|
|||||||||||||
copyright - designed by WSEAS |