Exact and heuristic algorithms for semi-nonnegative matrix factorization

SIAM Journal on Matrix Analysis and Applications

Volumn 36, Issue 4, 2015, Pages 1404-1424

  Gillis, Nicolas ^a   Kumar, Abhishek ^b  

^a UNIVERSITY OF MONS   (Belgium)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Algorithms; Initialization; Low Rank Matrix Approximation; Semi Nonnegative Matrix Factorization; Seminonnegative Rank

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; FACTORIZATION; HEURISTIC ALGORITHMS; OPTIMAL SYSTEMS; OPTIMIZATION; SINGULAR VALUE DECOMPOSITION;

INITIALIZATION; INITIALIZATION PROCEDURES; IRREDUCIBLE MATRICES; LOW-RANK MATRIX APPROXIMATIONS; NUMERICAL EXPERIMENTS; SEMI-NONNEGATIVE MATRIX FACTORIZATION (SEMI-NMF); SEMI-NONNEGATIVE MATRIX FACTORIZATIONS; SEMINONNEGATIVE RANK;

MATRIX ALGEBRA;

EID: 84959208291     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/140993272     Document Type: Article

References (27)

1. S. Arora and B. Barak, Computational Complexity: A Modern Approach, Cambridge University Press, Cambridge, 2009.
2. D.P. Bertsekas, Nonlinear Programming: 2nd ed., Athena Scientific, Belmont, MA, 1999.
3. D.P. Bertsekas, Corrections for the Book Nonlinear Programming (2nd ed.), http://www. athenasc.com/nlperrata.pdf (2014)
4. M. Bevilacqua, A. Roumy, C. Guillemot, and M.-L.A. Morel, Neighbor embedding based single-image super-resolution using semi-nonnegative matrix factorization, in Proceedings of the IEEE International Conferemce on Acoustics, Speech and Signal Processing (ICASSP), IEEE, Piscataway, NJ, 2012, pp. 1289-1292.
5. L. Blum, Computing over the reals: Where Turing meets Newton, Notices Amer. Math. Soc., 51 (2004), pp. 1024-1034.
6. R. Bro, E. Acar, and T.G. Kolda, Resolving the sign ambiguity in the singular value decomposition, J. Chemometrics, 22 (2008), pp. 135-140.
7. M. Chouh, , M. Hanafi, and K. Boukhetala, Semi-nonnegative rank for real matrices and its connection to the usual rank, Linear Algebra Appl., 466 (2015), pp. 27-37.
8. A. Cichocki and A.H. Phan, Fast local algorithms for large scale nonnegative matrix and tensor factorizations, IEICE Trans. Fundam. Electron., Vol. E92-A, (2009), pp. 708-721.
9. C. Ding, T. Li, and M.I. Jordan, Convex and semi-nonnegative matrix factorizations, IEEE Trans. Pattern Anal. Mach. Intell., 32 (2010), pp. 45-55.
10. J. Edmonds, Systems of distinct representatives and linear algebra, J. Res. Nat. Bur. Standards Sect. B, 71 (1967), pp. 241-245.
11. N. Gillis and F. Glineur, Accelerated multiplicative updates and hierarchical ALS algorithms for nonnegative matrix factorization, Neural Comput., 24 (2012), pp. 1085-1105.
12. N. Gillis and F. Glineur, On the geometric interpretation of the nonnegative rank, Linear Algebra Appl., 437 (2012), pp. 2685-2712.
13. N. Gillis and F. Glineur, A continuous characterization of the maximum-edge biclique problem, J. Global Optim., 58 (2014), pp. 439-464.
14. G.H. Golub and C.F. Van Loan, Matrix Computation, 3rd ed., The Johns Hopkins University Press, Baltimore, MD, 1996.
15. M. Grant and S. Boyd, Graph implementations for nonsmooth convex programs, in Recent Advances in Learning and Control (a Tribute to M. Vidyasagar), V. Blondel, S. Boyd, and H. Kimura, eds., Lecture Notes in Control and Inform. Sci., Springer, London, 2008, pp. 95-110.
16. M. Grant and S. Boyd, CVX: MATLAB Software for Disciplined Convex Programming, Version 1.21, http://cvxr.com/cvx/(2011).
17. C.-J. Hsieh and I.S. Dhillon, Fast coordinate descent methods with variable selection for nonnegative matrix factorization, in Proceedings of the 17th ACM International Conference on Knowledge Discovery and Data Mining, ACM, New York, 2011, pp. 1064-1072.
18. D.D. Lee and H.S. Seung, Learning the parts of objects by nonnegative matrix factorization, Nature, 401 (1999), pp. 788-791.
19. L. Li and Y.-J. Zhang, FastNMF: Highly efficient monotonic fixed-point nonnegative matrix factorization algorithm with good applicability, J. Electron. Imaging, 18 (2009), 033004.
20. J. Liu, J. Liu, P. Wonka, and J. Ye, Sparse non-negative tensor factorization using columnwise coordinate descent, Pattern Recognit., 45 (2012), pp. 649-656.
21. Q. Mo and B.A. Draper, Semi-nonnegative matrix factorization for motion segmentation with missing data, in Computer Vision-ECCV 2012, Springer, Berlin, 2012, pp. 402-415.
22. K.G. Murty and S.N. Kabadi, Some NP-complete problems in quadratic and nonlinear programming, Math. Program., 39 (1987), pp. 117-129.
23. L.N. Trefethen and D. Bau, III, Numerical Linear Algebra, SIAM, Philadelphia, 1997.
24. G. Trigeorgis, K. Bousmalis, S. Zafeiriou, and B.W. Schuller, A deep semi-NMF model for learning hidden representations, in International Conference on Machine Learning (ICML 14), 2014, pp. 1692-1700.
25. S.A Vavasis, Nonlinear Optimization: Complexity Issues, Oxford University Press, New York, 1991.
26. S.A. Vavasis, On the complexity of nonnegative matrix factorization, SIAM J. Optim., 20 (2010), pp. 1364-1377.
27. N. Yokoya, J. Chanussot, and A. Iwasaki, Generalized bilinear model based nonlinear unmixing using semi-nonnegative matrix factorization, in IEEE International Geoscience and Remote Sensing Symposium (IGARSS), IEEE, Piscataway, NJ, 2012, pp. 1365-1368.