Sparse nonnegative matrix factorization with ℓ0-constraints
Although nonnegative matrix factorization (NMF) favors a sparse and part-based representation of nonnegative data, there is no guarantee for this behavior. Several authors proposed NMF methods which enforce sparseness by constraining or penalizing the ℓ1-norm of the factor matrices. On the other han...
Main Authors: | Peharz, Robert, Pernkopf, Franz |
---|---|
Format: | Online |
Language: | English |
Published: |
Elsevier Science Publishers
2012
|
Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3312776/ |
Similar Items
-
Sparse Nonnegative Matrix Factorization Strategy for Cochlear Implants
by: Hu, Hongmei, et al.
Published: (2015) -
Parameter selection for nonnegative l1 matrix/tensor sparse decomposition
by: Wang, Y., et al.
Published: (2015) -
?-Divergence two-dimensional nonnegative matrix factorization with sparseness constraints for biomedical signal separation
by: Jawatankuasa Kerja PSM UTeM
Published: (2017) -
The Non-convex Sparse Problem with Nonnegative Constraint for Signal Reconstruction
by: Wang, Y., et al.
Published: (2016) -
Linear Program Relaxation of Sparse Nonnegative Recovery in Compressive Sensing Microarrays
by: Qin, Linxia, et al.
Published: (2012)