Unsupervised robust discriminative subspace representation based on discriminative approximate isometric embedding
From MaRDI portal
Publication:6488727
DOI10.1016/J.NEUNET.2022.06.003MaRDI QIDQ6488727
Publication date: 18 October 2023
Published in: Neural Networks (Search for Journal in Brave)
unsupervised learningdimensionality reductionJohnson-Lindenstrauss theoremdiscriminative approximate isometric embeddingLaplacian rankunsupervised robust discriminative subspace representation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- A geometric analysis of subspace clustering with outliers
- Low-rank representation with adaptive graph regularization
- Unsupervised robust discriminative manifold embedding with self-expressiveness
- Block diagonal representation learning for robust subspace clustering
- Sparser Johnson-Lindenstrauss Transforms
- Introduction to Information Retrieval
- Robust Neighborhood Preserving Projection by Nuclear/L2,1-Norm Regularization for Image Feature Extraction
- High-Dimensional Probability
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Learning Hybrid Representation by Robust Dictionary Learning in Factorized Compressed Space
- Provable Subspace Clustering: When LRR Meets SSC
- Robust Subspace Clustering With Compressed Data
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Unsupervised robust discriminative subspace representation based on discriminative approximate isometric embedding
