【摘要】 为了解决以欧氏距离作为相似性准则的传统模糊聚类算法对多维数据处理不利的问题,采用马氏距离代替欧氏距离,对基于马氏距离的模糊聚类算法进行优化研究,以增强基于马氏距离的模糊聚类算法的聚类效果和能力。通过构造启发式搜索与k-means算法结合的初始优化方法,利用可以自动调节最佳聚类数的有效性函数,提出了一种优化算法KM-FCM,并将此新算法与FCM,FCM-M,M-FCM聚类算法在3个标准数据集上进行了实验。结果表明,KM-FCM算法有效,聚类精度比FCM,FCM-M,M-FCM高,对高维数据聚类识别能力强,具有全局优化作用,并且聚类个数无需提前设定。新算法可为基于马氏距离的模糊聚类算法的优化提供参考。更多还原

【Abstract】 The traditional fuzzy clustering algorithm uses Euclidean distance as the similarity criterion,which is disadvantageous to the multidimensional data processing.In order to solve this situation,Mahalanobis distance is used instead of the traditional Euclidean distance,and the optimization of fuzzy clustering algorithm based on Mahalanobis distance is studied to enhance the clustering effect and ability.With making the initialization means by Heuristic search algorithm combined with k-means algorithm,and in terms of the validity function which could automatically adjust the optimal clustering number,an optimization algorithm KM-FCM is proposed.The new algorithm is compared with FCM algorithm,FCM-M algorithm and M-FCM algorithm in three standard data sets.The experimental results show that the KM-FCM algorithm is effective.It has higher clustering accuracy than FCM,FCM-M and M-FCM,recognizing high-dimensional data clustering well.It has global optimization effect,and the clustering number has no need for setting in advance.The new algorithm provides a reference for the optimization of fuzzy clustering algorithm based on Mahalanobis distance.更多还原