A New Membership Scaling Fuzzy C-Means Clustering Algorithm

Fuzzy c-means (FCM) is one of the most frequently used methods for clustering. However, with increasing amount of data, FCM suffers from slow convergence and a large amount of calculation because all samples are involved in updating the solutions per iteration without considering the current clustering results. In this article, a new membership scaling FCM (MSFCM) is proposed, based on the observation that the samples, whose nearest cluster center is v , aid the convergence of v , whereas the remaining samples prevent the convergence of v . In the new algorithm, many samples whose nearest cluster centers do not change in the next iteration are chosen by using the triangle inequality. A new scheme for scaling the membership degrees of the chosen samples is suggested to boost the effect of the in-cluster samples and to weaken the effect of the out-of-cluster samples in the clustering process. The new scheme not only accelerates the convergence of the algorithm but also maintains the high clustering quality. Many experimental results on synthetic and real-world data sets have verified the effectiveness of the proposed algorithm in improving the speed of the convergence of the fuzzy clustering. In particular, compared with FCM, MSFCM saves at least two thirds of the total rounds of iterations without significantly increasing the cost per iteration.