Nonnegative Matrix Factorization Action Set

References

  • Guan, N., Tao, D., Luo, Z., and Yuan, B. (2012). “NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization.” IEEE Transactions on Signal Processing 60:2882–2898.

  • Tepper, M., and Sapiro, G. (2016). “Compressed Nonnegative Matrix Factorization Is Fast and Accurate.” IEEE Transactions on Signal Processing 64:2269–2283.

  • Xu, Y., and Yin, W. (2013). “A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion.” SIAM Journal on Imaging Sciences 6:1758–1789.

  • Yahaya, F., Puigt, M., Delmaire, G., and Roussel, G. (2018). “Faster-Than-Fast NMF Using Random Projections and Nesterov Iterations.” In Proceedings of iTWIST: International Traveling Workshop on Interactions between Low-Complexity Data Models and Sensing Techniques. Marseille, France.

Last updated: September 09, 2021