The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Abstract
Nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer class discovery. The mathematical formulation for NMF appears as a non-convex optimization problem, and various types of algorithms have been devised to solve the problem. The alternating nonnegative least squares (ANLS) framework is a block coordinate descent approach for solving NMF, which was recently shown to be theoretically sound and empirically efficient. In this paper, we present a novel algorithm for NMF based on the ANLS framework. Our new algorithm builds upon the block principal pivoting method for the nonnegativity constrained least squares problem that overcomes some limitations of active set methods. We introduce ideas to efficiently extend the block principal pivoting method within the context of NMF computation. Our algorithm inherits the convergence theory of the ANLS framework and can easily be extended to other constrained NMF formulations. Comparisons of algorithms using datasets that are from real life applications as well as those artificially generated show that the proposed new algorithm outperforms existing ones in computational speed.
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
Introduction to information retrieval
(2009) · Choice Reviews Online · doi:10.5860/choice.46-2715 · Cited by 12,278
Introduction to Information Retrieval
Manning, C. D., Raghavan, P., & Schütze, H. (2008) · doi:10.1017/cbo9780511809071 · Cited by 11,288
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Cited by
Xu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2190406 · Cited by 468
Emergence of a High-Plasticity Cell State during Lung Cancer Evolution
Marjanovic, N. D., Hofree, M., Chan, J. E., Canner, D., Wu, K., Trakala, M., Hartmann, G. G., Smith, O. C., Kim, J. Y., Evans, K. V., et al. (2020) · Cancer Cell · doi:10.1016/j.ccell.2020.06.012 · Cited by 405
Self-citationKim, J., He, Y., & Park, H. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0035-4 · Cited by 352
Self-citationFast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
Kim, J., & Park, H. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/110821172 · Cited by 328
Self-citation
Metadata
- Authors
- Kim, J., & Park, H.
- Venue
- 2008 Eighth IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2008-12
- Pages
- 353-362
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2120816706
- Cited by
- 220
- References
- 3
- FWCI
- 6.41
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons. https://app.cochat.ai/papers/10.1109/icdm.2008.149
- The paper
- Kim, J., & Park, H. (2008). Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons. 2008 Eighth IEEE International Conference on Data Mining. https://doi.org/10.1109/icdm.2008.149
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.