Enriched Robust Multi-View Kernel Subspace Clustering
Subspace clustering is to find underlying low-dimensional subspaces and cluster the data points correctly. In this paper, we propose a novel multi-view subspace clustering method. Most existing methods suffer from two critical issues. First, they usually adopt a two-stage framework and isolate the processes of affinity learning, multi-view information fusion and clustering. Second, they assume the data lies in a linear subspace which may fail in practice as most real-world datasets may have non-linearity structures. To address the above issues, in this paper we propose a novel Enriched Robust Multi-View Kernel Subspace Clustering framework where the consensus affinity matrix is learned from both multi-view data and spectral clustering. Due to the objective and constraints which is difficult to optimize, we propose an iterative optimization method which is easy to implement and can yield closed solution in each step. Extensive experiments have validated the superiority of our method over state-of-the-art clustering methods.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringMulti-view Subspace ClusteringSimilar Papers 제목 키워드 기반
Robust Kernelized Multi-View Self-Representations for Clustering by Tensor Multi-Rank Minimization
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 ClusteringMulti-view Low-rank Sparse Subspace Clustering
Most existing approaches address multi-view subspace clustering problem by constructing the affinity matrix on each view separately and afterwards propose how to extend spectral clustering algorithm to handle multi-view …
ClusteringMulti-view Subspace ClusteringScalable Multi-view Clustering via Explicit Kernel Features Maps
A growing awareness of multi-view learning as an important component in data science and machine learning is a consequence of the increasing prevalence of multiple views in real-world applications, especially in the cont…
ClusteringMULTI-VIEW LEARNINGMulti-view Subspace ClusteringAdaptive Low-Rank Kernel Subspace Clustering
In this paper, we present a kernel subspace clustering method that can handle non-linear models. In contrast to recent kernel subspace clustering methods which use predefined kernels, we propose to learn a low-rank kerne…
ClusteringImage ClusteringMotion SegmentationOne-Step Late Fusion Multi-view Clustering with Compressed Subspace
Late fusion multi-view clustering (LFMVC) has become a rapidly growing class of methods in the multi-view clustering (MVC) field, owing to its excellent computational speed and clustering performance. One bottleneck face…
Clustering