Projected Gradient Methods for Nonnegative Matrix Factorization
The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Abstract
Nonnegative matrix factorization (NMF) can be formulated as a minimization problem with bound constraints. Although bound-constrained optimization has been studied extensively in both theory and practice, so far no study has formally applied its techniques to NMF. In this letter, we propose two projected gradient methods for NMF, both of which exhibit strong optimization properties. We discuss efficient implementations and demonstrate that one of the proposed methods converges faster than the popular multiplicative update approach. A simple Matlab code is also provided.
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
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
Bertsekas, D. P. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600425 · Cited by 11,726
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,968
Solving Least Squares Problems
Lawson, C. L., & Hanson, R. J. (1995) · doi:10.1137/1.9781611971217 · Cited by 7,103
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
RCV1: A New Benchmark Collection for Text Categorization Research
Lewis, D., Yang, Y., Rose, T. G., & Li, F. (2004) · Goldsmiths (University of London) · doi:10.5555/1005332.1005345 · Cited by 2,503
Metagenes and molecular pattern discovery using matrix factorization
Brunet, J.-P., Tamayo, P., Golub, T. R., & Mesirov, J. P. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0308531101 · Cited by 2,183
Document clustering based on non-negative matrix factorization
Xu, W., Liu, X., & Gong, Y. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860485 · Cited by 1,860
Hoyer, P. O. (2003) · Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing · doi:10.1109/nnsp.2002.1030067 · Cited by 804
Paatero, P. (1999) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1999.10474853 · Cited by 756
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
Donoho, D. L., & Stodden, V. (2004) · doi:10.7916/d88d05n7 · Cited by 685
On the convergence of the block nonlinear Gauss–Seidel method under convex constraints
Grippo, L., & Sciandrone, M. (2000) · Operations Research Letters · doi:10.1016/s0167-6377(99)00074-7 · Cited by 678
Projected gradient methods for linearly constrained problems
Calamai, P. H., & Moré, J. J. (1987) · Mathematical Programming · doi:10.1007/bf02592073 · Cited by 588
On the Goldstein-Levitin-Polyak gradient projection method
Bertsekas, D. P. (1976) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1976.1101194 · Cited by 583
Paatero, P. (1999) · Journal of Computational and Graphical Statistics · doi:10.2307/1390831 · Cited by 510
On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.895831 · Cited by 416
Self-citationNewton's Method for Large Bound-Constrained Optimization Problems
Lin, C., & Morè, J. J. (1999) · SIAM Journal on Optimization · doi:10.1137/s1052623498345075 · Cited by 405
Self-citationOn search directions for minimization algorithms
Powell, M. J. D. (1973) · Mathematical Programming · doi:10.1007/bf01584660 · Cited by 338
Accelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization
Gonzalez, E. F., & Zhang, Y. (2005) · Rice Research Repository (Rice University) · Cited by 200
Algorithms for Sparse Nonnegative Tucker Decompositions
Mørup, M., Hansen, L. K., & Arnfred, S. M. (2008) · Neural Computation · doi:10.1162/neco.2008.11-06-407 · Cited by 167
Topology Preserving Non-negative Matrix Factorization for Face Recognition
Zhang, T., Fang, B., Tang, Y. Y., He, G., & Wen, J. A. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.918957 · Cited by 152
Tensor methods for hyperspectral data analysis: a space object material identification study
Zhang, Q., Wang, H., Plemmons, R. J., & Pauca, V. P. (2008) · Journal of the Optical Society of America A · doi:10.1364/josaa.25.003001 · Cited by 109
Computing non-negative tensor factorizations
Friedlander, M. P., & Hatz, K. (2008) · Optimization methods & software · doi:10.1080/10556780801996244 · Cited by 92
Nonnegative Matrix Factorization with Gaussian Process Priors
Schmidt, M. N., & Laurberg, H. (2008) · Computational Intelligence and Neuroscience · doi:10.1155/2008/361705 · Cited by 89
Zdunek, R., & Cichocki, A. S. (2008) · Computational Intelligence and Neuroscience · doi:10.1155/2008/939567 · Cited by 67
Object Characterization from Spectral Data Using Nonnegative Factorization and Information Theory
Piper, J. W., Pauca, V. P., Plemmons, R. J., & Giffin, M. (2004) · Cited by 54
Cited by
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
Proximal alternating linearized minimization for nonconvex and nonsmooth problems
Bolte, J., Sabach, S., & Teboulle, M. (2014) · Mathematical Programming · doi:10.1007/s10107-013-0701-9 · Cited by 1,688
Algorithms and applications for approximate nonnegative matrix factorization
Berry, M. W., Browne, M., Langville, A. N., Pauca, V. P., & Plemmons, R. J. (2007) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2006.11.006 · Cited by 1,512
Baroni, M., Dinu, G., & Kruszewski, G. (2014) · Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.3115/v1/p14-1023 · Cited by 1,364
Coupled Nonnegative Matrix Factorization Unmixing for Hyperspectral and Multispectral Data Fusion
Yokoya, N., Yairi, T., & Iwasaki, A. (2012) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2161320 · Cited by 1,180
Metadata
- Authors
- Lin, C.-J.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2007-10
- Volume
- 19
- Issue
- 10
- Pages
- 2756-2779
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2110096996
- Cited by
- 1,737
- References
- 28
- FWCI
- 83.35
- Type
- journal article
- 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
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.