By Topic

A Robust Automatic Merging Possibilistic Clustering Method

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Miin-Shen Yang ; Dept. of Appl. Math., Chung Yuan Christian Univ., Chungli, Taiwan ; Chien-Yo Lai

Krishnapuram and Keller [IEEE Trans. Fuzzy Syst., vol. 1, no. 2, pp. 98-110, May 1993] proposed a possibilistic c-means (PCM) clustering by relaxing the constraint in fuzzy c-means (FCMs) that the memberships of a data point across classes sum to 1. The PCM algorithm has a tendency to produce coincident clusters. This can be a merit of PCM as a good mode-seeking algorithm if initials and parameters are suitably chosen. However, the performance of PCM heavily depends on initializations and parameter selection. In this paper, we propose a mechanism of robust automatic merging. We then create an automatic merging possibilistic clustering method (AM-PCM), where the proposed algorithm does not only solve these parameter-selection and initialization problems but also obtains an optimal cluster number. The proposed AM-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 AM-PCM can exhibit the robustness to parameter, noise, cluster number, different volumes, and initializations. The computational complexity of AM-PCM is also analyzed. Comparisons between AM-PCM and other clustering methods are made. Some numerical data and real datasets are used to show these good aspects of AM-PCM. Experimental results and comparisons actually demonstrate that the proposed AM-PCM is an effective and parameter-free robust clustering algorithm.

Published in:

Fuzzy Systems, IEEE Transactions on  (Volume:19 ,  Issue: 1 )