Sciweavers

Share
PR
2006

Unsupervised possibilistic clustering

8 years 10 months ago
Unsupervised possibilistic clustering
In fuzzy clustering, the fuzzy c-means (FCM) clustering algorithm is the best known and used method. Since the FCM memberships do not always explain the degrees of belonging for the data well, Krishnapuram and Keller proposed a possibilistic approach to clustering to correct this weakness of FCM. However, the performance of Krishnapuram and Keller's approach depends heavily on the parameters. In this paper, we propose another possibilistic clustering algorithm (PCA) which is based on the FCM objective function, the partition coefficient (PC) and partition entropy (PE) validity indexes. The resulting membership becomes the exponential function, so that it is robust to noise and outliers. The parameters in PCA can be easily handled. Also, the PCA objective function can be considered as a potential function, or a mountain function, so that the prototypes of PCA can be correspondent to the peaks of the estimated function. To validate the clustering results obtained through a PCA, we ...
Miin-Shen Yang, Kuo-Lung Wu
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where PR
Authors Miin-Shen Yang, Kuo-Lung Wu
Comments (0)
books