Robustness analysis of hottopixx, a linear programming model for factoring nonnegative matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 34, Issue 3, 2013, Pages 1189-1212

  Gillis, Nicolas ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Hottopixx; Linear programming; Nonnegative matrix factorization; Robustness to noise; Separability

Indexed keywords

HOTTOPIXX; LINEAR PROGRAMMING MODELS; NEAR- DUPLICATES; NON-NEGATIVE MATRIX; NONNEGATIVE MATRIX FACTORIZATION; ROBUSTNESS ANALYSIS; ROBUSTNESS TO NOISE; SEPARABILITY;

LINEAR PROGRAMMING;

MATRIX ALGEBRA;

EID: 84887361620     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/120900629     Document Type: Article

References (10)

1. S. Arora, R. Ge, R. Kannan, and A. Moitra, Computing a nonnegative matrix factorization-provably, in Proceedings of the 44th Symposium on Theory of Computing, STOC'12, 2012, pp. 145-162.
2. S. Arora, R. Ge, and A. Moitra, Learning topic models-going beyond SVD, in Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS'12, 2012, pp. 1-10.
3. V. Bittorf, B. Recht, E. Ŕe, and J. Tropp, Factoring nonnegative matrices with linear programs, in Adv. Neural Inform. Process. Syst., 25 (2012), pp. 1223-1231.
4. E. Elhamifar, G. Sapiro, and R. Vidal, See all by looking at a few: Sparse modeling for finding representative objects, in Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 2012.
5. E. Esser, M. Moller, S. Osher, G. Sapiro, and J. Xin, A convex model for nonnegative matrix factorization and dimensionality reduction on physical space, IEEE Trans. Image Process., 21 (2012), pp. 3239-3252.
6. N. Gillis and R. Luce, Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization, arXiv:1302.4385, 2013.
7. N. Gillis and S. Vavasis, Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization, arXiv:1208.1237, 2012.
8. A. Kumar, V. Sindhwani, and P. Kambadur, Fast conical hull algorithms for near-separable non-negative matrix factorization, in Proceedings of the International Conference on Machine Learning (ICML), 2013.
9. D. Lee and H. Seung, Learning the parts of objects by nonnegative matrix factorization, Nature, 401 (1999), pp. 788-791.
10. S. Vavasis, On the complexity of nonnegative matrix factorization, SIAM J. Optim., 20 (2009), pp. 1364-1377.