Kernel Two-Dimensional Ridge Regression for Subspace Clustering
Subspace clustering methods have been widely studied recently. When the inputs are 2-dimensional (2D) data, existing subspace clustering methods usually convert them into vectors, which severely damages inherent structures and relationships from original data. In this paper, we propose a novel subspace clustering method for 2D data. It directly uses 2D data as inputs such that the learning of representations benefits from inherent structures and relationships of the data. It simultaneously seeks image projection and representation coefficients such that they mutually enhance each other and lead to powerful data representations. An efficient algorithm is developed to solve the proposed objective function with provable decreasing and convergence property. Extensive experimental results verify the effectiveness of the new method.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringregressionVocal Bursts Valence PredictionSimilar Papers 제목 키워드 기반
Adaptive 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 SegmentationKernel Truncated Regression Representation for Robust Subspace Clustering
Subspace clustering aims to group data points into multiple clusters of which each corresponds to one subspace. Most existing subspace clustering approaches assume that input data lie on linear subspaces. In practice, ho…
ClusteringregressionAverage Gradient Outer Product in kernel regression provably recovers the central subspace for multi-index models
We study a prototypical situation when a learned predictor can discover useful low-dimensional structure in data, while using fewer samples than are needed for accurate prediction. Specifically, we consider the problem o…
Sparse Subspace Clustering with Entropy-Norm
Sparse subspace clustering (SSC) and spectral clustering (SC) are both state-of-the-art methods to identify complex clusters in high-dimensional input space. However, there are few researches to discuss the relation betw…
ClusteringSubspace Clustering by Mixture of Gaussian Regression
Subspace clustering is a problem of finding a multisubspace representation that best fits sample points drawn from a high-dimensional space. The existing clustering models generally adopt different norms to describe nois…
Clusteringregression