Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
From MaRDI portal
Publication:2015273
Recommendations
- Nonlinear dimensionality reduction based on dictionary learning
- Robust Non-Linear Matrix Factorization for Dictionary Learning, Denoising, and Clustering
- Non-linear dictionary learning with partially labeled data
- Proximal alternating method for dictionary learning
- Alternating direction method of multipliers for solving dictionary learning models
- Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization
- Dictionary Learning With Few Samples and Matrix Concentration
Cites work
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Review of Image Denoising Algorithms, with a New One
- A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
- Document clustering using nonnegative matrix factorization
- Learning the parts of objects by non-negative matrix factorization
- Least angle regression. (With discussion)
- Non-negative matrix factorization with sparseness constraints
- Nonnegative matrix factorization for spectral data analysis
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Online learning for matrix factorization and sparse coding
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Pathwise coordinate optimization
- Recursive Least Squares Dictionary Learning Algorithm
Cited in
(2)
This page was built for publication: Dictionary learning based on nonnegative matrix factorization using parallel coordinate descent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015273)
