Li, DongZhou, ShuishengPedrycz, Witold2024-05-192024-05-1920231041-43471558-2191https://doi.org10.1109/TKDE.2023.3273274https://hdl.handle.net/20.500.12713/5148Fuzzy C-Means (FCM) is a widely used clustering method. However, FCM and its many accelerated variants have low efficiency in the mid-to-late stage of the clustering process. In this stage, all samples are involved in updating their non-affinity centers, and the membership grades of most samples, whose assignments remain unchanged, are still updated by calculating the sample-center distances. All these factors lead to the algorithms converging slowly. In this paper, a new affinity filtering technique is developed to recognize a complete set of non-affinity centers for each sample with low computations. Then, a new membership scaling technique is suggested to set the membership grades between each sample and its non-affinity centers to 0 and maintain the fuzzy membership grades for others. By integrating these two techniques, FCM based on new affinity filtering and membership scaling (AMFCM) is proposed to accelerate the whole convergence process of FCM. Numerous experimental results performed on synthetic and real-world data sets have shown the feasibility and efficiency of the proposed algorithm. Compared with state-of-the-art algorithms, AMFCM is significantly faster and more effective. For example, AMFCM reduces the number of FCM iterations by 80% on average.eninfo:eu-repo/semantics/openAccessFuzzy C-MeansAffinity FilteringTriangle InequalityNon-Affinity CenterNon-Affinity SampleMembership ScalingArticle35121233712349WOS:0011051521000322-s2.0-85162877746N/A10.1109/TKDE.2023.3273274Q1