paper-with-me

Papers

On Unifying Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization

2016-10-23 · Yuan Xie, DaCheng Tao, Wensheng Zhang, Lei Zhang, Yan Liu, Yanyun Qu

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 then rotating, to capture the low rank tensor subspace so that the refinement of the view-specific subspaces can be achieved, as well as the high order correlations underlying multi-view data can be explored.} By introducing a recently proposed tensor factorization, namely tensor-Singular Value Decomposition (t-SVD) \cite{kilmer13}, we can impose a new type of low-rank tensor constraint on the rotated tensor to capture the complementary information from multiple views. Different from traditional unfolding based tensor norm, this low-rank tensor constraint has optimality properties similar to that of matrix rank derived from SVD, so the complementary information among views can be explored more efficiently and thoroughly. The established model, called t-SVD based Multi-view Subspace Clustering (t-SVD-MSC), falls into the applicable scope of augmented Lagrangian method, and its minimization problem can be efficiently solved with theoretical convergence guarantee and relatively low computational complexity. Extensive experimental testing on eight challenging image dataset shows that the proposed method has achieved highly competent objective performance compared to several state-of-the-art multi-view clustering methods.

📄 PDF Abstract BibTeX arXiv:1610.07126

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringMulti-view Subspace Clustering

Similar Papers 제목 키워드 기반

Self-Supervised Information Bottleneck for Deep Multi-View Subspace Clustering

2022-04-26 · Shiye Wang, Changsheng Li, Yanming Li, Ye Yuan 외

In this paper, we explore the problem of deep multi-view subspace clustering framework from an information-theoretic point of view. We extend the traditional information bottleneck principle to learn common information a…

ClusteringMulti-view Subspace Clustering

Joint Adaptive Neighbours and Metric Learning for Multi-view Subspace Clustering

2017-09-12 · Nan Xu, Yanqing Guo, Jiujun Wang, Xiangyang Luo 외

Due to the existence of various views or representations in many real-world data, multi-view learning has drawn much attention recently. Multi-view spectral clustering methods based on similarity matrixes or graphs are p…

ClusteringMetric LearningMULTI-VIEW LEARNINGMulti-view Subspace Clustering

Robust Kernelized Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization

2017-09-15 · Yanyun Qu, Jinyan Liu, Yuan Xie, Wensheng Zhang

Most recently, tensor-SVD is implemented on multi-view self-representation clustering and has achieved the promising results in many real-world applications such as face clustering, scene clustering and generic object cl…

ClusteringFace Clustering

Multi-view Deep Subspace Clustering Networks

2019-08-06 · Pengfei Zhu, Xinjie Yao, Yu Wang, Binyuan Hui 외

Multi-view subspace clustering aims to discover the inherent structure of data by fusing multiple views of complementary information. Most existing methods first extract multiple types of handcrafted features and then le…

ClusteringDiversityModel SelectionMulti-view Subspace Clustering

Partially latent factors based multi-view subspace learning

2022-01-04 · Run-kun Lu, Jian-wei Liu, Ze-Yu Liu, Jin-zhong Chen

Multi-view subspace clustering always performs well in high-dimensional data analysis, but is sensitive to the quality of data representation. To this end, a two stage fusion strategy is proposed to embed representation …

ClusteringMulti-view Subspace ClusteringRepresentation Learning