Fuzzy ensemble clustering methods that rely on the fuzzy co-association (FCA) matrix often focus predominantly on optimizing the FCA matrix itself, while insufficiently addressing the critical role of fuzzy connective matrices. This limitation results in three shortcomings: (1) the absence of localized connectivity among samples within fuzzy connective matrices, (2) the neglect of varying reliability across clusters during relational propagation, and (3) the underutilization of complementary structural information inherent in multiple fuzzy connective matrices. To overcome these challenges, this study introduces a novel fuzzy ensemble clustering method, termed FECM-LEFCM (Fuzzy Ensemble Clustering Method with Learned Enhanced Fuzzy Connective Matrices), which systematically enhances the representational capacity of fuzzy connective matrices through three innovative mechanisms. At the sample level, an adaptive neighborhood learning mechanism is proposed to establish localized connections among samples. At the cluster level, a dynamic reliability assessment mechanism is developed to assign weights to clusters based on their quality. At the base clustering level, multiple fuzzy connective matrices are integrated into a third-order tensor to facilitate information exchange and leverage structural complementarity. Furthermore, by incorporating a Laplacian rank constraint into the enhanced fuzzy connective matrices, FECM LEFCM directly constructs an FCA matrix containing the exact ground-truth cluster number connected components, eliminating the need for post-processing to obtain the final clustering result. Experimental evaluations demonstrate the superior performance of FECM-LEFCM compared to state-of-the-art methods.
Although ensemble clustering methods based on the co-association (CA) matrix have achieved considerable success, they still face the following challenges: (1) in the label space, the noise within the connective matrices and the structural differences between them are often neglected, and (2) the rich structural information inherent in the feature space is overlooked. Specifically, for each connective matrix, a symmetric error matrix is first introduced in the label space to characterize the noise. Then, a set of mapping models is designed, each of which processes a denoised connective matrix to recover a reliable consensus matrix. Moreover, multi-order graph structures are introduced into the feature space to enhance the expressiveness of the consensus matrix further. To preserve a clear cluster structure, a theoretical rank constraint with a block-diagonal enhancement property is imposed on the consensus matrix. Finally, spectral clustering is applied to the refined consensus matrix to obtain the final clustering result. Experimental results demonstrate that ECM-RCL achieves superior clustering performance compared to several state-of-the-art methods.