Double structure scaled simplex representation for multi-view subspace clustering

Liang Yao

doi:10.1016/j.neunet.2022.03.039

Return

Double structure scaled simplex representation for multi-view subspace clustering

2022-07-01

PRE

Liang Yao

Gui-Fu Lu *

DOI：10.1016/j.neunet.2022.03.039

Original

Save

Abstract

En 中文

In the era of big data, there are an increasing number of multisource information data, and multi-view clustering (MVC) algorithms have developed rapidly. However, the affinity matrix learned by most MVC methods is not clean and precise enough and cannot describe the latent structure of multi-view data accurately, which results in poor clustering performance. In this paper, we propose a novel Double Structure Scaled Simplex Representation (DSSSR) method for MVC. Initially, we concatenate the multi-view data into a joint representation. Then, we use the scaled simplex representation (SSR) method on the concatenated data to obtain the affinity matrix. However, the affinity matrix is not clean and precise. Therefore, we use the SSR method again on the obtained affinity matrix to obtain a more accurate and clean affinity matrix. Furthermore, the two-step SSR is integrated into a unified optimization framework, a clean and accurate affinity matrix can be obtained, and the sum of each column vector of the affinity matrix is constrained to be nonnegative and equal to s (0 < s < 1), which can be adjusted to obtain the best clustering performance. Finally, an efficient optimization algorithm based on the augmented Lagrangian method (ALM) for solving the objective function is also designed. The experimental results on some datasets show that this algorithm has better clustering performance than some state-of-the-art algorithms. (C)& nbsp;2022 Elsevier Ltd. All rights reserved.

Keywords:

Multi -view subspace clustering

Affinity matrix

Clustering performance

Objective function