Tensor-based Intrinsic Subspace Representation Learning for Multi-view Clustering
As a hot research topic, many multi-view clustering approaches are proposed over the past few years. Nevertheless, most existing algorithms merely take the consensus information among different views into consideration for clustering. Actually, it may hinder the multi-view clustering performance in real-life applications, since different views usually contain diverse statistic properties. To address this problem, we propose a novel Tensor-based Intrinsic Subspace Representation Learning (TISRL) for multi-view clustering in this paper. Concretely, the rank preserving decomposition is proposed firstly to effectively deal with the diverse statistic information contained in different views. Then, to achieve the intrinsic subspace representation, the tensor-singular value decomposition based low-rank tensor constraint is also utilized in our method. It can be seen that specific information contained in different views is fully investigated by the rank preserving decomposition, and the high-order correlations of multi-view data are also mined by the low-rank tensor constraint. The objective function can be optimized by an augmented Lagrangian multiplier based alternating direction minimization algorithm. Experimental results on nine common used real-world multi-view datasets illustrate the superiority of TISRL.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringMulti-view Subspace ClusteringRepresentation LearningSimilar Papers 제목 키워드 기반
Tensor Sparse and Low-Rank based Submodule Clustering Method for Multi-way Data
A new submodule clustering method via sparse and low-rank representation for multi-way data is proposed in this paper. Instead of reshaping multi-way data into vectors, this method maintains their natural orders to prese…
ClusteringAdaptively Topological Tensor Network for Multi-view Subspace Clustering
Multi-view subspace clustering methods have employed learned self-representation tensors from different tensor decompositions to exploit low rank information. However, the data structures embedded with self-representatio…
ClusteringMulti-view Subspace ClusteringTensor DecompositionTensor NetworksLow-Rank Tensor Constrained Multiview Subspace Clustering
In this paper, we explore the problem of multiview subspace clustering. We introduce a low-rank tensor constraint to explore the complementary information from multiple views and, accordingly, establish a novel method ca…
ClusteringOn Unifying Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization
In this paper, we address the multi-view subspace clustering problem. Our method utilizes the circulant algebra for tensor, which is constructed by stacking the subspace representation matrices of different views and the…
ClusteringMulti-view Subspace ClusteringAnchor Structure Regularization Induced Multi-view Subspace Clustering via Enhanced Tensor Rank Minimization
The tensor-based multi-view subspace clustering algorithms have received widespread attention due to the powerful ability to capture high-order correlation across views. Although such algorithms have achieved remarka…
ClusteringMulti-view Subspace Clustering