Compressed Nonnegative Matrix Factorization Is Fast and Accurate
From MaRDI portal
Publication:4618319
DOI10.1109/TSP.2016.2516971zbMath1416.65121arXiv1505.04650MaRDI QIDQ4618319
Guillermo Sapiro, Mariano Tepper
Publication date: 7 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.04650
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ A goodness-of-fit test on the number of biclusters in a relational data matrix ⋮ Randomized algorithms for orthogonal nonnegative matrix factorization ⋮ Unnamed Item
This page was built for publication: Compressed Nonnegative Matrix Factorization Is Fast and Accurate
