在众多聚类算法中,基于划分的模糊聚类算法是模式识别中最常用的算法类型之一.至今,文献中仍不断

有关于基于划分的模糊聚类算法的研究成果出现.为了能更为系统和深入地了解这些聚类算法及其性质,本文从改

变度量方式、改变约束条件、在目标函数中引入熵以及考虑对聚类中心进行约束等几个方面,对在 C-均值算法的

基础上得到的基于划分的模糊聚类算法作了综述和评价,对各典型算法的优缺点进行了实验比较分析.指出标准

FCM算法被广泛应用的原因之一是它对数据的比例变化具有鲁棒性,而其他类似的算法对这种比例变化却很敏感,

并以极大熵方法为例进行了比较实验.最后总结了基于划分的模糊聚类算法普遍存在的问题及其发展前景. -Fuzzy partitional clustering algorithms are widely used in pattern recognition field. Until now, more

and more research results on them have been　developed　in the literature. In order　to　study these algorithms

systematically and deeply, they are reviewed in this paper based on c-means algorithm, from metrics, entropy, and

constraints on membership function or cluster centers. Moreover, the advantages and disadvantages of the typical

fuzzy partitional algorithms are discussed. It is pointed out that the standard FCM algorithm is robust to the scaling

transformation of　dataset, while　others are　sensitive to　such transformation. Such conclusion is experimentally

verified　when　implementing the standard FCM and the　maximum entropy clustering　algorithm. Finally, the

problems existing in these algorithms and the prospects of the fuzzy partitional algorithms are discussed.