Generalized fuzzy C-means clustering algorithm with improved fuzzy partitions

  • Authors:
  • Lin Zhu;Fu-Lai Chung;Shitong Wang

  • Affiliations:
  • School of Information Technology, Southern Yangtze University, Wuxi, China;Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong;School of Information Technology, Southern Yangtze University, Wuxi, China and Department of Computing, Hong Kong Polytechnic University, Kowloon, Hong Kong

  • Venue:
  • IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

The fuzziness index m has important influence on the clustering result of fuzzy clustering algorithms, and it should not be forced to fix at the usual value m = 2. In view of its distinctive features in applications and its limitation in having m = 2 only, a recent advance of fuzzy clustering called fuzzy c-means clustering with improved fuzzy partitions (IFP-FCM) is extended in this paper, and a generalized algorithm called GIFP-FCM for more effective clustering is proposed. By introducing a novel membership constraint function, a new objective function is constructed, and furthermore, GIFP-FCM clustering is derived. Meanwhile, from the viewpoints of Lp norm distance measure and competitive learning, the robustness and convergence of the proposed algorithm are analyzed. Furthermore, the classical fuzzy c-means algorithm (FCM) and IFP-FCM can be taken as two special cases of the proposed algorithm. Several experimental results including its application to noisy image texture segmentation are presented to demonstrate its average advantage over FCM and IFP-FCM in both clustering and robustness capabilities.