Subspace structural constraint-based discriminative feature learning via nonnegative low rank representation
نویسندگان
چکیده
منابع مشابه
Low-rank representation based discriminative projection for robust feature extraction
The low-rank representation (LRR) was presented recently and showed effective and robust for subspace segmentation. This paper presents a LRR-based discriminative projection method (LRR-DP) for robust feature extraction, by virtue of the underlying low-rank structure of data represesntation revealed by LRR. LRR-DP seeks a linear transformation such that in the transformed space, the betweenlarg...
متن کاملDeep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning
Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...
متن کاملGene Feature Extraction Based on Nonnegative Dual Graph Regularized Latent Low-Rank Representation
Aiming at the problem of gene expression profile's high redundancy and heavy noise, a new feature extraction model based on nonnegative dual graph regularized latent low-rank representation (NNDGLLRR) is presented on the basis of latent low-rank representation (Lat-LRR). By introducing dual graph manifold regularized constraint, the NNDGLLRR can keep the internal spatial structure of the origin...
متن کاملRobust Subspace Segmentation by Low-Rank Representation
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank representation among all the candidates that represent all vectors as the linear combination of the bases in a dictionary. Unlike the well-known sparse representation (SR), which computes the sparsest representation of each d...
متن کاملSymmetric low-rank representation for subspace clustering
We propose a symmetric low-rank representation (SLRR) method for subspace clustering, which assumes that a data set is approximately drawn from the union of multiple subspaces. The proposed technique can reveal the membership of multiple subspaces through the self-expressiveness property of the data. In particular, the SLRR method considers a collaborative representation combined with low-rank ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2019
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0215450