Ellipsoidal rounding for nonnegative matrix factorization under noisy separability

Journal of Machine Learning Research

Volumn 15, Issue , 2014, Pages 1011-1039

  Mizutani, Tomohiko ^a  

^a KANAGAWA UNIVERSITY   (Japan)

Author keywords

Document clustering; Enclosing ellipsoid; Nonnegative matrix factorization; Robustness to noise; Separability

Indexed keywords

COMPUTATIONAL GEOMETRY; INFORMATION RETRIEVAL;

DOCUMENT CLUSTERING; ENCLOSING ELLIPSOID; NONNEGATIVE MATRIX FACTORIZATION; ROBUSTNESS TO NOISE; SEPARABILITY;

ALGORITHMS;

EID: 84899876632     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (35)

1. S. D. Ahipasaoglu, P. Sun, and M. J. Todd. Linear convergence of a modified Frank-Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optimization Methods and Software, 23(1):5-19, 2008.
2. 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), pages 145-162, 2012a.
3. S. Arora, R. Ge, and A. Moitra. Learning topic models - Going beyond SVD. In Proceedings of the 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS), pages 1-10, 2012b.
4. S. Arora, R. Ge, Y. Halpern, D. Mimno, and A. Moitra. A practical algorithm for topic modeling with provable guarantees. In Proceedings of the 30th International Conference on Machine Learning (ICML), 2013.
5. V. Bittorf, B. Recht, C. Re, and J. A. Tropp. Factoring nonnegative matrices with linear programs. In Advances in Neural Information Processing Systems 25 (NIPS), pages 1223-1231, 2012.
6. A. Cichocki, R. Zdunek, A. H. Phan, and S. Amari. Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. Wiley, 2009.
7. W. Ding, M. H. Rohban, P. Ishwar, and V. Saligrama. Topic discovery through data dependent and random projections. In Proceedings of the 30th International Conference on Machine Learning (ICML), 2013.
8. D. Donoho and V. Stodden. When does non-negative matrix factorization give a correct decomposition into parts? In Advances in Neural Information Processing Systems 16 (NIPS), pages 1141-1148, 2003.
9. N. Gillis. Robustness analysis of Hottopixx, a linear programming model for factoring nonnegative matrices. SIAM Journal on Matrix Analysis and Applications, 34(3):1189- 1212, 2013.
10. N. Gillis and R. Luce. Robust near-separable nonnegative matrix factorization using linear optimization. arXiv:1302.4385v1, 2013.
11. N. Gillis and S. A. Vavasis. Fast and robust recursive algorithms for separable nonnegative matrix factorization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(4):698-714, 2014.
12. G. H. Golub and C. F. Van Loan. Matrix Computation. The Johns Hopkins University Press, 3rd edition, 1996.
13. P. Gong and C. Zhang. Eficient nonnegative matrix factorization via projected newton method. Pattern Recognition, 45(9):3557-3565, 2012.
14. D. Greene and P. Cunningham. Practical solutions to the problem of diagonal dominance in kernel document clustering. In Proceedings of the 23th International Conference on Machine Learning (ICML), 2006.
15. L. G. Khachiyan. Rounding of polytopes in the real number model of computation. Math- ematics of Operations Research, 21(2):307-320, 1996. (Pubitemid 126600322)
16. H. Kim and H. Park. Non-negative matrix factorization based on alternating non-negativity constrained least squares and active set method. SIAM Journal on Matrix Analysis and Applications, 30(2):713-730, 2008.
17. H. Kim and H. Park. Fast nonnegative matrix factorization: An active-set-like method and comparisons. SIAM Journal on Scientific Computing, 33(6):3261-3281, 2011.
18. J. Kim, Y. He, and H. Park. Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework. Journal of Global Optimization, 58(2):285-319, 2014.
19. A. Kumar, V. Sindhwani, and P. Kambadur. Fast conical hull algorithms for near-separable non-negative matrix factorization. In Proceedings of the 30th International Conference on Machine Learning (ICML), 2013.
20. P. Kumar and E. A. Yildirim. Minimum-volume enclosing ellipsoids and core sets. Journal of Optimization Theory and Applications, 126(1), 2005.
21. D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401:788-791, 1999.
22. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems 13 (NIPS), pages 556-562, 2001.
23. C.-J. Lin. Projected gradient methods for non-negative matrix factorization. Neural Com- putation, 19(10):2756-2779, 2007.
24. C. D. Manning, P. Raghavan, and H. Schuetze. Introduction to Information Retrieval. Cambridge University Press, 2008.
25. L. Miao and H. Qi. Endmember extraction from highly mixed data using minimum volume constrained nonnegative matrix factorization. IEEE Transactions on Geoscience and Remote Sensing, 45(2):765-777, 2007. (Pubitemid 46375748)
26. J. M. P. Nascimento and J. M. B. Dias. Vertex component analysis: A fast algorithm to unmix hyperspectral data. IEEE Transactions on Geoscience and Remote Sensing, 43 (4):898-910, 2005. (Pubitemid 40476033)
27. F. Shahnaz, M. W. Berry, V. P. Pauca, and R. J. Plemmons. Document clustering using nonnegative matrix factorization. Information Processing and Management, 42(2):373-386, 2006. (Pubitemid 41394167)
28. P. Sun and R. M. Freund. Computation of minimum-volume covering ellipsoids. Operations Research, 52(5):690-706, 2004.
29. M. J. Todd and E. A. Yildirim. On Khachiyan's algorithm for the computation of minimumvolume enclosing ellipsoids. Discrete Applied Mathematics, 155(13):1731-1744, 2007. (Pubitemid 47176135)
30. K.-C. Toh. Primal-dual path-following algorithms for determinant maximization problems with linear matrix inequalities. Computational Optimization and Applications, 14(3): 309-330, 1999.
31. K.-C. Toh, M. J. Todd, and R. H. Tütüncü. SDPT3 - a MATLAB software package for semidefinite programming. Optimization Methods and Software, 11:545-581, 1999.
32. T. Tsuchiya and Y. Xia. An extension of the standard polynomial-time primal-dual pathfollowing algorithm to the weighted determinant maximization problem with semidefinite constraints. Pacific Journal of Optimization, 3(1):165-182, 2007.
33. L. Vandenberghe, S. Boyd, and S. P. Wu. Determinant maximization with linear matrix inequality constraints. SIAM Journal on Matrix Analysis and Applications, 19(2):499-533, 1998.
34. S. A. Vavasis. On the complexity of nonnegative matrix factorization. SIAM Journal of Optimization, 20(3):1364-1377, 2009.
35. W. Xu, X. Liu, and Y. Gong. Document clustering based on non-negative matrix factorization. In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pages 267-273, 2003.