The DOI matches its Crossref record; 1 of the 1 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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Cited by
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
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
Interventional Fairness: Causal Database Repair for Algorithmic Fairness
Salimi, B., Rodriguez, L., Howe, B., & Suciu, D. (2019) · Proceedings of the 2019 International Conference on Management of Data · doi:10.1145/3299869.3319901 · Cited by 145
Evolution of brain network dynamics in neurodevelopment
Chai, L. R., Khambhati, A. N., Ciric, R., Moore, T. M., Gur, R. C., Gur, R. E., Satterthwaite, T. D., & Bassett, D. S. (2017) · Network Neuroscience · doi:10.1162/netn_a_00001 · Cited by 100
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
- 1
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On the Complexity of Nonnegative Matrix Factorization. https://app.cochat.ai/papers/10.1137/070709967
- The paper
- Vavasis, S. A. (2010). On the Complexity of Nonnegative Matrix Factorization. SIAM Journal on Optimization. https://doi.org/10.1137/070709967
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.
