Computing a nonnegative matrix factorization - Provably

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2012, Pages 145-161

  Arora, Sanjeev ^a   Ge, Rong ^a   Kannan, Ravindran ^b   Moitra, Ankur ^c  

^a Princeton University   (United States)

^b MICROSOFT RESEARCH   (United States)

^c INSTITUTE FOR ADVANCED STUDY   (United States)

Author keywords

data analysis; nonnegative matrix factorization; semi algebric sets

Indexed keywords

CHEMOMETRICS; COMMUNICATION COMPLEXITY; HARDNESS RESULT; INPUT MATRICES; LOCAL SEARCH HEURISTICS; N-MATRIX; NOISE-TOLERANT; NON-TRIVIAL; NONNEGATIVE MATRIX FACTORIZATION; NP COMPLETE; POLYHEDRAL COMBINATORICS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PROBABILITY THEORY; SEMI-ALGEBRIC SETS; TIME ALGORITHMS; TIME POLYNOMIALS;

ALGORITHMS; COMPUTATION THEORY; DATA REDUCTION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; QUANTUM THEORY;

MATRIX ALGEBRA;

EID: 84862609231     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2213977.2213994     Document Type: Conference Paper

References (44)

1. A. Aho, J. Ullman and M. Yannakakis. On notions of information transfer in VLSI circuits. STOC, pp. 133-139, 1983.
2. N. Alon and S. Onn. Separable partitions. Discrete Applied Math., pp. 39-51, 1999. (Pubitemid 129665088)
3. S. Basu, R. Pollack and M. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, pp. 1002-1045, 1996.
4. Preliminary version in FOCS 1994.
5. D. Blei. Personal communication.
6. D. Blei, A. Ng and M. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, pp. 993-1022, 2003.
7. Preliminary version in NIPS 2001.
8. L. Blum, F. Cucker, M. Shub and S. Smale. Complexity of Real Computations. Springer Verlag, 1998.
9. G. Buchsbaum and O. Bloch. Color categories revealed by non-negative matrix factorization of Munsell color spectra. Vision Research, pp. 559-563, 2002. (Pubitemid 34164261)
10. J. Cohen and U. Rothblum. Nonnegative ranks, decompositions and factorizations of nonnegative matices. Linear Algebra and its Applications, pp. 149-168, 1993.
11. S. Deerwester, S. Dumais, T. Landauer, G. Furnas and R. Harshman. Indexing by latent semantic analysis. JASIS, pp. 391-407, 1990.
12. D. Donoho and V. Stodden. When does non-negative matrix factorization give the correct decomposition into parts? NIPS, 2003.
13. S. Fiorini, T. Rothvoß and H. Tiwary. Extended formulations for polygons. Arxiv, 2011.
14. G. Golub and C. van Loan. Matrix Computations The Johns Hopkins University Press, 1996.
15. D. Yu. Grigor'ev and N.N. Vorobjov Jr. Solving systems of polynomial inequalities in subexponential time, Journal of Symbolic Computation, Volume 5, Issues 1-2, February-April 1988, pp. 37-64
16. E. Harding. The number of partitions of a set of N points in k dimensions induced by hyperplanes. Edinburgh Math. Society, pp. 285-289, 1967.
17. L. Henry. Schémas de nuptialité: déséquilibre des sexes et célibat. Population 24:457-486, 1969.
18. T. Hofmann. Probabilistic latent semantic analysis. UAI, pp. 289-296, 1999.
19. P. Hoyer. Non-negative matrix factorization with sparseness constraints. Journal of Machine Learning Research, pp. 1457-1469, 2004.
20. F. Hwang and U. Rothblum. On the number of separable partitions. Journal of Combinatorial Optimization, pp. 423-433, 2011.
21. A. Hyvärinen, J. Karhunen and E. Oja. Independent Component Analysis. Wiley Interscience, 2001.
22. R. Impagliazzo and R. Paturi. On the complexity of k-SAT. J. Computer and System Sciences 62(2):pp. 367-375, 2001. (Pubitemid 32334556)
23. J. Kleinberg and M. Sandler. Using mixture models for collaborative filtering. JCSS, pp. 49-69, 2008.
24. Preliminary version in STOC 2004.
25. R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins. Recommendation systems: a probabilistic analysis. JCSS, pp. 42-61, 2001.
26. Preliminary version in FOCS 1998.
27. W. Lawton and E. Sylvestre. Self modeling curve resolution. Technometrics, pp. 617- 633, 1971.
28. D. Lee and H. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, pp. 788-791, 1999.
29. D. Lee and H. Seung. Algorithms for non-negative matrix factorization. NIPS, pp. 556-562, 2000.
30. L. Lovász and M. Saks. Communication complexity and combinatorial lattice theory. JCSS, pp. 322-349, 1993.
31. Preliminary version in FOCS 1988.
32. J. Matousek. Lectures on Discrete Geometry. Springer, 2002.
33. N. Nisan. Lower bounds for non-commutative computation (extended abstract). STOC, pp. 410-418, 1991.
34. P. Paatero and U. Tapper. Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Environmetrics, pp. 111-126, 1994.
35. M. Patrascu and R. Williams. On the possibility of faster SAT algorithms. SODA, pp. 1065-1075, 2010.
36. C. Papadimitriou, P. Raghavan, H. Tamaki and S. Vempala. Latent semantic indexing: a probabilistic analysis. JCSS, pp. 217-235, 2000.
37. Preliminary version in PODS 1998.
38. J. Renegar. On the Computational Complexity and Geometry of the First-Order Theory of the Reals. Journal of Symbolic Computation, Volume 13, Issue 3, March 1992, pp. 255-352.
39. A. Seidenberg. A new decision method for elementary algebra. Annals of Math, pp. 365-374, 1954.
40. A. Tarski. A decision method for elementary algebra and geometry. University of California Press, 1951.
41. W. Xu and X. Liu and Y. Gong. Document clustering based on non-negative matrix factorization. SIGIR, pp. 267-273, 2003.
42. S. Vavasis. On the complexity of nonnegative matrix factorization. SIAM Journal on Optimization, pp. 1364-1377, 2009.
43. M. Yannakakis. Expressing combinatorial optimization problems by linear programs. JCSS, pp. 441-466, 1991.
44. Preliminary version in STOC 1988.