Fetching the paper…
Reading the bibliography…
In the Nonnegative Matrix Factorization (NMF) problem we are given an $n \times m$ nonnegative matrix $M$ and an integer $r > 0$.
A decision method for elementary algebra and geometry
A. Tarski · 1951
Earlier work this paper cites.
A new decision method for elementary algebra
A. Seidenberg · 1954
Earlier work this paper cites.
The number of partitions of a set of N N points in k k dimensions induced by hyperplanes
E. Harding · 1967
Earlier work this paper cites.
Schémas de nuptialité: déséquilibre des sexes et célibat
L. Henry · 1969
Earlier work this paper cites.
Self modeling curve resolution
W. Lawton and E. Sylvestre · 1971
Earlier work this paper cites.
On notions of information transfer in VLSI circuits
A. Aho, J. Ullman and M. Yannakakis · 1983
Earlier work this paper cites.
Solving systems of polynomial inequalities in subexponential time,
D. Yu. Grigor’ev and N.N. Vorobjov Jr · 1988
Earlier work this paper cites.
Communication complexity and combinatorial lattice theory
L. Lovász and M. Saks · 1988
Earlier work this paper cites.
Expressing combinatorial optimization problems by linear programs
M. Yannakakis · 1988
Earlier work this paper cites.
Indexing by latent semantic analysis
S. Deerwester, S. Dumais, T. Landauer, G. Furnas and R. Harshman · 1990
Earlier work this paper cites.
Lower bounds for non-commutative computation (extended abstract)
N. Nisan · 1991
Earlier work this paper cites.
On the Computational Complexity and Geometry of the First-Order Theory of the Reals
J. Renegar · 1992
Earlier work this paper cites.
Nonnegative ranks, decompositions and factorizations of nonnegative matices
J. Cohen and U. Rothblum · 1993
Cited alongside, same era.
On the combinatorial and algebraic complexity of quantifier elimination
S. Basu, R. Pollack and M. Roy · 1994
Cited alongside, same era.
Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values
P. Paatero and U. Tapper · 1994
Cited alongside, same era.
Matrix Computations
G. Golub and C. van Loan · 1996
Cited alongside, same era.
Complexity of Real Computations
L. Blum, F. Cucker, M. Shub and S. Smale · 1998
Cited alongside, same era.
Recommendation systems: a probabilistic analysis
R. Kumar, P. Raghavan, S. Rajagopalan and A. Tomkins · 1998
Cited alongside, same era.
Independent Component Analysis
A. Hyvärinen, J. Karhunen and E. Oja · 2001
Later among the works it cites.
On the complexity of k-SAT
R. Impagliazzo and R. Paturi · 2001
Later among the works it cites.
Color categories revealed by non-negative matrix factorization of Munsell color spectra
G. Buchsbaum and O. Bloch · 2002
Later among the works it cites.
Lectures on Discrete Geometry
J. Matousek · 2002
Later among the works it cites.
When does non-negative matrix factorization give the correct decomposition into parts?
D. Donoho and V. Stodden · 2003
Later among the works it cites.
Document clustering based on non-negative matrix factorization
W. Xu and X. Liu and Y. Gong · 2003
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Latent semantic indexing: a probabilistic analysis
C. Papadimitriou, P. Raghavan, H. Tamaki and S. Vempala · 1998
Cited alongside, same era.
Separable partitions
N. Alon and S. Onn · 1999
Cited alongside, same era.
Probabilistic latent semantic analysis
T. Hofmann · 1999
Cited alongside, same era.
Learning the parts of objects by non-negative matrix factorization
D. Lee and H. Seung · 1999
Cited alongside, same era.
Algorithms for non-negative matrix factorization
D. Lee and H. Seung · 2000
Cited alongside, same era.
Latent Dirichlet allocation
D. Blei, A. Ng and M. Jordan · 2001
Cited alongside, same era.
Non-negative matrix factorization with sparseness constraints
P. Hoyer · 2004
Later among the works it cites.
Using mixture models for collaborative filtering
J. Kleinberg and M. Sandler · 2004
Later among the works it cites.
On the complexity of nonnegative matrix factorization
S. Vavasis · 2009
Later among the works it cites.
On the possibility of faster SAT algorithms
M. Patrascu and R. Williams · 2010
Later among the works it cites.
Extended formulations for polygons
S. Fiorini, T. Rothvoß · 2011
Closest in time.
On the number of separable partitions
F. Hwang and U. Rothblum · 2011
Closest in time.