Late Fusion Multiview Clustering via Min-Max Optimization

Abstract

Multiview clustering (MVC) sufficiently exploits the diverse and complementary information among different views to improve the clustering performance. As a representative algorithm of MVC, the newly proposed simple multiple kernel k -means (SimpleMKKM) algorithm takes a min-max formulation and applies a gradient descent algorithm to decrease the resultant objective function. It is empirically observed that its superiority is attributed to the novel min-max formulation and the new optimization. In this article, we propose to integrate the min-max learning paradigm adopted by SimpleMKKM into late fusion MVC (LF-MVC). This leads to a tri-level max-min-max optimization problem with respect to the perturbation matrices, weight coefficient, and clustering partition matrix. To solve this intractable max-min-max optimization problem, we design an efficient two-step alternative optimization strategy. Furthermore, we analyze the generalization clustering performance of the proposed algorithm from the theoretical perspective. Comprehensive experiments have been conducted to evaluate the proposed algorithm in terms of clustering accuracy (ACC), computation time, convergence, as well as the evolution of the learned consensus clustering matrix, clustering with different numbers of samples, and analysis of the learned kernel weight. The experimental results show that the proposed algorithm is able to significantly reduce the computation time and improve the clustering ACC when compared to several state-of-the-art LF-MVC algorithms. The code of this work is publicly released at: https://xinwangliu.github.io/Under-Review.