Unsupervised possibilistic clustering

Yang, MS

doi:10.1016/j.patcog.2005.07.005

2006-01-01

164

PRE

Yang, MS *

DOI：10.1016/j.patcog.2005.07.005

原文链接

原文求助

摘要

En 中文

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 Kilshnapuram 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 generalized the validity indexes of FCM. This generalization makes each validity index workable in both fuzzy and possibilistic clustering models. By combining these generalized validity indexes, an unsupervised possibilistic clustering is proposed. Some numerical examples and real data implementation on the basis of the proposed PCA and generalized validity indexes show their effectiveness and accuracy. C 2005 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keyword:

fuzzy clustering

possibilistic clustering

fuzzy c-means

validity indexes

fuzzy c-partitions

possibilistic c-memberships

robustness