The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
On the Complexity of Nonnegative Matrix Factorization
Open accessAbstract
Nonnegative matrix factorization (NMF) has become a prominent technique for the analysis of image databases, text databases, and other information retrieval and clustering applications. The problem is most naturally posed as continuous optimization. In this report, we define an exact version of NMF. Then we establish several results about exact NMF: (i) that it is equivalent to a problem in polyhedral combinatorics; (ii) that it is NP-hard; and (iii) that a polynomial-time local search heuristic exists.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1979) · Cited by 43,841
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
Golub, G. H., & Loan, C. F. V. (1996) · Johns Hopkins University Press eBooks · Cited by 6,027
Probabilistic Latent Semantic Analysis
Hofmann, T. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.6705 · Cited by 2,047
Complexity and real computation
(1998) · Choice Reviews Online · doi:10.5860/choice.35-6275c · Cited by 1,228
Kim, H., & Park, H. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm134 · Cited by 863
Matrix Computations, 3rd Edition
Golub, G. H. (2007) · Cited by 787
SVD based initialization: A head start for nonnegative matrix factorization
Boutsidis, C., & Gallopoulos, E. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.09.010 · Cited by 695
Iterative signature algorithm for the analysis of large-scale gene expression data
Bergmann, S., Ihmels, J., & Barkai, N. (2003) · Physical Review E · doi:10.1103/physreve.67.031902 · Cited by 419
Nonnegative matrix factorization via rank-one downdate
Biggs, M., Ghodsi, A., & Vavasis, S. A. (2008) · International Conference on Machine Learning · doi:10.1145/1390156.1390165 · Cited by 31
Self-citationUsing Rank-One Biclusters to Classify Microarray Data
Asgarian, N., & Greiner, R. (2007) · Cited by 10
Cited by
Most Tensor Problems Are NP-Hard
Hillar, C. J., & Lim, L.-H. (2013) · Journal of the ACM · doi:10.1145/2512329 · Cited by 1,099
Nonnegative Matrix Factorization: A Comprehensive Review
Wang, Y.-X., & Zhang, Y.-J. (2013) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.51 · Cited by 981
A Signal Processing Perspective on Hyperspectral Unmixing: Insights from Remote Sensing
Ma, W.-K., Bioucas-Dias, J. M., Chan, T.-H., Gillis, N., Gader, P., Plaza, A. J., Ambikapathi, A., & Chi, C.-Y. (2014) · IEEE Signal Processing Magazine · doi:10.1109/msp.2013.2279731 · Cited by 456
Kim, J., He, Y., & Park, H. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0035-4 · Cited by 352
Lectures on Algebraic Statistics
Drton, M., Sturmfels, B., & Sullivant, S. (2009) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-8905-5 · Cited by 365
Metadata
- Authors
- Vavasis, S. A.
- Venue
- SIAM Journal on Optimization
- Published
- 2010-01
- Volume
- 20
- Issue
- 3
- Pages
- 1364-1377
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W2124172487
- Cited by
- 588
- References
- 12
- FWCI
- 14.49
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.