Self-Weighted Multi-View Fuzzy Clustering With Multiple Graph Learning

Graph-based multi-view clustering has garnered considerable attention owing to its effectiveness. Nevertheless, despite the promising performance achieved by previous studies, several limitations remain to be addressed. Most graph-based models employ a two-stage strategy involving relaxation and discretization to derive clustering results, which may lead to deviation from the original problem. Moreover, graph-based methods do not adequately address the challenges of overlapping clusters or ambiguous cluster membership. Additionally, assigning appropriate weights based on the importance of each view is crucial. To address these problems, we propose a self-weighted multi-view fuzzy clustering algorithm that incorporates multiple graph learning. Specifically, we automatically allocate weights corresponding to each view to construct a fused similarity graph matrix. Subsequently, we approximate it as the scaled product of fuzzy membership matrices to directly derive clustering assignments. An iterative optimization algorithm is designed for solving the proposed model. Experiment evaluations conducted on benchmark datasets illustrate that the proposed method outperforms several leading multi-view clustering approaches.