Alternative c-means clustering algorithms

被引:464
作者
Wu, KL [1 ]
Yang, MS [1 ]
机构
[1] Chung Yuan Christian Univ, Dept Math, Chungli 32023, Taiwan
关键词
hard c-means; fuzzy c-means; alternative c-means; fixed-point iterations; robustness; noise;
D O I
10.1016/S0031-3203(01)00197-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we propose a new metric to replace the Euclidean norm in c-means clustering procedures. On the basis of the robust statistic and the influence function, we claim that the proposed new metric is more robust than the Euclidean norm. We then create two new clustering methods called the alternative hard c-means (AHCM) and alternative fuzzy c-means (AFCM) clustering algorithms. These alternative types of c-means clustering have more robustness than c-means clustering, Numerical results show that AHCM has better performance than HCM and AFCM is better than FCM. We recommend AFCM for use in cluster analysis. Recently, this AFCM algorithm has successfully been used in segmenting the magnetic resonance image of Ophthalmology to differentiate the abnormal tissues from the normal tissues. (C), 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:2267 / 2278
页数:12
相关论文
共 15 条