One‐step multiple kernel k‐means clustering based on block diagonal representation

Abstract

Multiple kernel k‐means clustering (MKKC) can efficiently incorporate multiple base kernels to generate an optimal kernel. Many existing MKKC methods all need two‐step operation: learning clustering indicator matrix and performing clustering on it. However, the optimal clustering results of two steps are not equivalent to those of original problem. To address this issue, in this paper we propose a novel method named one‐step multiple kernel k‐means clustering based on block diagonal representation (OS‐MKKC‐BD). By imposing a block diagonal constraint on the product of indicator matrix and its transpose, this method can encourage the indicator matrix to be block diagonal. Then the indicator matrix can produce explicit clustering indicator, so as to implement one‐step clustering, which avoids the disadvantage of two‐step operation. Furthermore, a simple kernel weighting strategy is used to obtain an optimal kernel, which boosts the quality of optimal kernel. In addition, a three‐step iterative algorithm is designed to solve the corresponding optimization problem, where the Riemann conjugate gradient iterative method is used to solve the optimization problem of the indicator matrix. Finally, by extensive experiments on eleven real data sets and comparison of clustering results with 10 MKC methods, it is concluded that OS‐MKKC‐BD is effective.