VC++实现的fcm算法演示程序，FCM算法是一种基于划分的聚类算法，它的思想就是使得被划分到同一簇的对象之间相似度最大，而不同簇之间的相似度最校FCM算法需要两个参数一个是聚类数目C，另一个是参数m。一般来讲C要远远小于聚类样本的总个数，同时要保证C>1。对于m，它是一个控制算法的柔性的参数，如果m过大，则聚类效果会很次，而如果m过小则算法会接近HCM聚类算法。-Realized VC++ FCM algorithm demo program, FCM algorithm is a clustering algorithm based on partition, the thought of it is making is divided into the greatest similarity between objects of the same cluster, and the similarity between different clusters school FCM algorithm requires two parameters is the number of clusters C, and the other is a parameter m. In general, C is much less than the total number of cluster sample, at the same time to ensure that C>　1. For m, It is a control a flexible algorithm parameters, if m is too large, then the clustering effect will be times, if m is too small, the algorithm will be close to the HCM clustering algorithm.