Fast conical hull algorithms for near-separable non-negative matrix factorization

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 231-239

  Kumar, Abhishek ^a   Sindhwani, Vikas ^b   Kambadur, Prabhanjan ^b  

^a University of Maryland   (United States)

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

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LEARNING SYSTEMS;

DISTRIBUTED MEMORY; FINITE SET; HIGH SCALABILITIES; HULL ALGORITHMS; NOISE ROBUST; NONNEGATIVE MATRIX FACTORIZATION; PARALLEL IMPLEMENTATIONS;

FACTORIZATION;

EID: 84894650699     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. Arora, Sanjeev, Ge, Rong, Kannan, Ravi, and Moitra, Ankur. Computing a nonnegative matrix factorization - provably. In STOC, 2012a.
2. Arora, Sanjeev, Ge, Rong, and Moitra, Ankur. Learning topic models - going beyond svd. In FOCS, 2012b.
3. Bien, J., Xu, Y., and Mahoney, M. CUR from a sparse optimization viewpoint. In NIPS, 2010.
4. Bittorf, Victor, Recht, Benjamin, Re, Christopher, and Tropp, Joel A. Factoring nonnegative matrices with linear programs. In NIPS, 2012.
5. Buhlmann, Peter and Geer, Sara Van De. Statistics for High Dimensional Data. Springer, 2010.
6. Cichocki, A., Zdunek, R., Phan, A. H., and Amari, S. Non-negative Matrix and Tensor Factorizations. Wiley, 2009.
7. Clarkson, K. More output-sensitive geometric algorithms. In FOCS, 1994.
8. Donoho, D. and Stodden, V. When does non-negative matrix factorization give a correct decomposition into parts? In NIPS, 2003.
9. Dula, J. H., Hegalson, R. V., and Venugopal, N. An algorithm for identifying the frame of a pointed finite conical hull. INFORMS Jour. on Comp., 10(3):323-330, 1998. (Pubitemid 128669137)
10. Elhamifar, Ehsan, Sapiro, Guillermo, and Vidal, Rene. See all by looking at a few: Sparse modeling for finding representative objects. In CVPR, 2012.
11. Esser, Ernie, Mller, Michael, Osher, Stanley, Sapiro, Guillermo, and Xin, Jack. A convex model for non-negative matrix factorization and dimensionality reduction on physical space. IEEE Transactions on Image Processing, 21(10):3239-3252, 2012.
12. Fan, R.-E., Chang, K.-W., Hsieh, C.-J., Wang, X.-R., and Lin, C.-J. Liblinear: A library for large linear classification. JMLR, 2008.
13. Gillis, Nicolas and Vavasis, Stephen A. Fast and robust recursive algorithms for separable nonnegative matrix factorization. arXiv:1208.1237v2, 2012.
14. Greene, Derek and Cunningham, Padraig. Practical solutions to the problem of diagonal dominance in kernel document clustering. In ICML, 2006.
15. Hsieh, C. J. and Dhillon, I. S. Fast coordinate descent methods with variable selection for non-negative matrix factorization. In KDD, 2011.
16. Kambadur, P., Gupta, A., Ghoting, A., Avron, H., and Lumsdaine, A. PFunc: Modern Task Parallelism For Modern High Performance Computing. In ACM/IEEE conference on Supercomputing, 2009.
17. Kumar, Abhishek, Sindhwani, Vikas, and Kambadur, Prabhanjan. Fast conical hull algorithms for near-separable non-negative matrix factorization. arXiv.1210.1190, 2012.
18. Lee, D. and Seung, S. Learning the parts of objects by non-negative matrix factorization. Nature, 401 (6755):788-791, 1999.
19. Lemur, http://lemurproject.org/clueweb09/.
20. Lewis, D, Yang, Y, Rose, T, and Li, F. RCV1: A new benchmark collection for text categorization research. Journal Of Machine Learning Research, 5:361-397, 2004.
21. Lin, C.-J. Projected gradient methods for non-negative matrix factorization. Neural Computation, 2007.
22. Nemirovski, A. Lecture Notes: Introduction to Linear Optimization. 2010.
23. Reuters. archive.ics.uci.edu/ml/datasets/Reuters- 21578+Text+Categorization+Collection.
24. TDT2. http://www.itl.nist.gov/iad/mig/tests/tdt/1998/.
25. Tropp, J. A. Algorithms for simultaneous sparse approximation. part ii: Convex relaxation. Signal Processing, 86:589-602, 2006. (Pubitemid 43106573)
26. Tropp, J. A., Gilbert, A. C., and Strauss, M. J. Algorithms for simultaneous sparse approximation. part i: Greedy pursuit. Signal Processing, 86:572-588, 2006. (Pubitemid 43106572)
27. Vavasis, S. On the complexity of non-negative matrix factorization. SIAM Journal on Optimization, 20 (3):1364-, 2009.