Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
From MaRDI portal
Publication:2339393
DOI10.1016/j.neunet.2014.01.001zbMath1308.68102OpenAlexW1987486886WikidataQ30762215 ScholiaQ30762215MaRDI QIDQ2339393
Shuicheng Yan, Mingbo Zhao, Zhao Zhang
Publication date: 1 April 2015
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2014.01.001
low-rank representationfeature learningsimilarity preservationLaplacian regularizationsubspace recoveryenhanced representation
Related Items (3)
Robust alternating low-rank representation by joint \(L_p\)- and \(L_{2,p}\)-norm minimization ⋮ Accelerated low-rank representation for subspace clustering and semi-supervised classification on large-scale data ⋮ A general soft label based linear discriminant analysis for semi-supervised dimensionality reduction
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Manifold elastic net: a unified framework for sparse dimension reduction
- Constrained large margin local projection algorithms and extensions for multimodal dimensionality reduction
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Sparsity preserving projections with applications to face recognition
- A cellular automaton model based on empirical observations of a driver's oscillation behavior reproducing the findings from Kerner's three-phase traffic theory
- Principal component analysis.
- Marginal semi-supervised sub-manifold projections with informative constraints for dimensionality reduction and recognition
- Active Subspace: Toward Scalable Low-Rank Learning
- Robust principal component analysis?
- Rank-Sparsity Incoherence for Matrix Decomposition
- A Fast Algorithm for Edge-Preserving Variational Multichannel Image Restoration
- A generalized proximal point algorithm for certain non-convex minimization problems
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- Learning with $\ell ^{1}$-graph for image analysis
- Graph Regularized Sparse Coding for Image Representation
- Pairwise Sparsity Preserving Embedding for Unsupervised Subspace Learning and Classification
- Model Selection and Estimation in Regression with Grouped Variables
This page was built for publication: Similarity preserving low-rank representation for enhanced data representation and effective subspace learning
