Learning a Nonnegative Sparse Graph for Linear Regression
From MaRDI portal
Cited in
(5)- Kernel negative \(\varepsilon\) dragging linear regression for pattern classification
- Orthogonal self-guided similarity preserving projection for classification and clustering
- Nonnegative matrix factorization with region sparsity learning for hyperspectral unmixing
- A splitting method for the locality regularized semi-supervised subspace clustering
- Constrained randomized Gauss-Seidel methods for nonnegative least-squares problem
This page was built for publication: Learning a Nonnegative Sparse Graph for Linear Regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4612955)