Federated Fuzzy C-Means (FCM) clustering methods have demonstrated success in standard federated learning (FL) environments, but model heterogeneity presents a significant challenge. This heterogeneity hampers communication content selection and makes traditional aggregation methods, such as federated averaging (FedAvg), insufficient for diverse client models. Additionally, handling non-IID data distributions and learning robust feature representations remain unresolved in some existing approaches. To tackle these issues, we propose FFCMD, a federated FCM clustering framework designed to address model heterogeneity while enhancing feature learning and accommodating non-IID data. FFCMD integrates an autoencoder (AE) with a fuzzy C-Means network (FCMN), augmented by mutual knowledge distillation (mKD), to improve data feature learning, communication, and aggregation under heterogeneous conditions. The AE incorporates a clustering-oriented penalty term to learn discriminative features, boosting performance on complex datasets. Rather than direct parameter aggregation, mKD updates the global model using local devices' soft assignments, naturally handling structural variations across client models. Moreover, FFCMD employs discrepancy-aware weighting mechanisms to dynamically align local and global category distributions during soft assignment embedding, effectively addressing the challenges posed by non-IID data. Extensive experiments on multiple public datasets show that FFCMD outperforms state-of-the-art methods, particularly in non-IID scenarios, and excels even in the presence of model heterogeneity.

Incomplete data clustering is often encountered in practice. Here the treatment of missing attribute value and the optimization procedure of clustering are the important factors impacting the clustering performance. In this study, a missing attribute value becomes an information granule and is represented as a certain interval. To avoid intervals determined by different cluster information, we propose a congeneric nearest-neighbor rule-based architecture of the preclassification result, which can improve the effectiveness of estimation of missing attribute interval. Furthermore, a global fuzzy clustering approach using particle swarm optimization assisted by the Fuzzy C-Means is proposed. A novel encoding scheme where particles are composed of the cluster prototypes and the missing attribute values is considered in the optimization procedure. The proposed approach improves the accuracy of clustering results, moreover, the missing attribute imputation can be implemented at the same time. The experimental results of several UCI data sets show the efficiency of the proposed approach.

In this paper, a fuzzy c-means clustering algorithm based on interval-valued weights is proposed for improving clustering performance. In the proposed algorithm, the interval-valued weights are first constructed by synergy of the ReliefF algorithm and the analytic hierarchy process (AHP) method, and then they are transformed into a constraint condition associating with each weight variable in the weighted clustering objective function. In the sequence, the weighted clustering objective function is solved by combining the Lagrange multiplier method with the gradient-based iteration computation. In the whole process of algorithm iteration, a compulsion strategy with human–computer cooperation is adopted to ensure each weight variable satisfies interval constraint itself. Three well-known data set are used to perform profound experiments. Experimental results clearly show that the proposed algorithm has better clustering performance than other the weighted fuzzy c-means clustering algorithm.