Low-Rank Tensor Based Proximity Learning for Multi-View Clustering
Graph-oriented multi-view clustering methods have achieved impressive performances by employing relationships and complex structures hidden in multi-view data. However, most of them still suffer from the following two common problems. (1) They target at studying a common representation or pairwise correlations between views, neglecting the comprehensiveness and deeper higher-order correlations among multiple views. (2) The prior knowledge of view-specific representation can not be taken into account to obtain the consensus indicator graph in a unified graph construction and clustering framework. To deal with these problems, we propose a novel Low-rank Tensor Based Proximity Learning (LTBPL) approach for multi-view clustering, where multiple low-rank probability affinity matrices and consensus indicator graph reflecting the final performances are jointly studied in a unified framework. Specifically, multiple affinity representations are stacked in a low-rank constrained tensor to recover their comprehensiveness and higher-order correlations. Meanwhile, view-specific representation carrying different adaptive confidences is jointly linked with the consensus indicator graph. Extensive experiments on nine real-world datasets indicate the superiority of LTBPL compared with the state-of-the-art methods.
Code (1)
Tasks
Clusteringgraph constructionSimilar Papers 제목 키워드 기반
Adaptively 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 ClusteringTensor-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 f…
ClusteringMulti-view Subspace ClusteringRepresentation LearningMulti-View Spectral Clustering Tailored Tensor Low-Rank Representation
This paper explores the problem of multi-view spectral clustering (MVSC) based on tensor low-rank modeling. Unlike the existing methods that all adopt an off-the-shelf tensor low-rank norm without considering the special…
Clustering