Robust classifier using distance-based representation with square weights
From MaRDI portal
Recommendations
- A fast sparse representation based classification
- Locality-sensitive dictionary learning for sparse representation based classification
- Gene expression data classification model based on sparse representation and least square regression
- Image classification using kernel collaborative representation with regularized least square
- Beyond sparsity: the role of \(L_{1}\)-optimizer in pattern classification
Cites work
- rm K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- 10.1162/153244304322972667
- Block-Sparse Recovery via Convex Optimization
- Convergence Analysis of a Class of HyvÄrinen–Oja's ICA Learning Algorithms With Constant Learning Rates
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Global convergence of Oja's PCA learning algorithm with a non-zero-approaching adaptive learning rate
- Greed is Good: Algorithmic Results for Sparse Approximation
- Learning with $\ell ^{1}$-graph for image analysis
- On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
- Online learning for matrix factorization and sparse coding
- Recovery of Exact Sparse Representations in the Presence of Bounded Noise
- Robust subspace clustering
Cited in
(2)
This page was built for publication: Robust classifier using distance-based representation with square weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344071)