The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization
Abstract
Nonnegative matrix factorization (NMF) is useful to find basis information of nonnegative data. Currently, multiplicative updates are a simple and popular way to find the factorization. However, for the common NMF approach of minimizing the Euclidean distance between approximate and true values, no proof has shown that multiplicative updates converge to a stationary point of the NMF optimization problem. Stationarity is important as it is a necessary condition of a local minimum. This paper discusses the difficulty of proving the convergence. We propose slight modifications of existing updates and prove their convergence. Techniques invented in this paper may be applied to prove the convergence for other bound-constrained optimization problems.
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,878
Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 8,890
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
Projected Gradient Methods for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.10.2756 · Cited by 1,737
Self-citationAlgorithms 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
(2000) · Electric Power System Applications of Optimization · doi:10.1201/9781420056266-13 · Cited by 908
Cited by
Graph Regularized Nonnegative Matrix Factorization for Data Representation
Cai, D., He, X., Han, J., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.231 · Cited by 2,451
Projected Gradient Methods for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · Neural Computation · doi:10.1162/neco.2007.19.10.2756 · Cited by 1,737
Self-citationAlgorithms 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
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
Algorithms for Nonnegative Matrix Factorization with the β-Divergence
Févotte, C., & Idier, J. (2011) · Neural Computation · doi:10.1162/neco_a_00168 · Cited by 663
Constrained Nonnegative Matrix Factorization for Image Representation
Liu, H., Wu, Z., Cai, D., & Huang, T. S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2011.217 · Cited by 520
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
Kim, J., He, Y., & Park, H. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0035-4 · Cited by 352
Uncovering novel mutational signatures by de novo extraction with SigProfilerExtractor
Islam, S. M. A., Díaz-Gay, M., Wu, Y., Barnes, M., Vangara, R., Bergstrom, E. N., He, Y., Vella, M., Wang, J., Teague, J. W., et al. (2022) · Cell Genomics · doi:10.1016/j.xgen.2022.100179 · Cited by 365
Exemplar-Based Sparse Representations for Noise Robust Automatic Speech Recognition
Gemmeke, J. F., Virtanen, T., & Hurmalainen, A. (2011) · IEEE Transactions on Audio, Speech, and Language Processing · doi:10.1109/tasl.2011.2112350 · Cited by 328
Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2105496 · Cited by 318
Graph dual regularization non-negative matrix factorization for co-clustering
Shang, F., Jiao, L. C., & Wang, F. (2012) · Pattern Recognition · doi:10.1016/j.patcog.2011.12.015 · Cited by 314
Yang, Z., & Michailidis, G. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btv544 · Cited by 295
Online Nonnegative Matrix Factorization With Robust Stochastic Approximation
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197827 · Cited by 287
On Tensors, Sparsity, and Nonnegative Factorizations
Chi, E. C., & Kolda, T. G. (2012) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110859063 · Cited by 274
DDTCDR: Deep Dual Transfer Cross Domain Recommendation
Li, P., & Tuzhilin, A. (2020) · Proceedings of the 13th International Conference on Web Search and Data Mining · doi:10.1145/3336191.3371793 · Cited by 269
An, J., Kwak, H., Jung, S.-G., Salminen, J., & Jansen, B. J. (2018) · Social Network Analysis and Mining · doi:10.1007/s13278-018-0531-0 · Cited by 164
Online Non-Negative Convolutive Pattern Learning for Speech Signals
Wang, D., Vipperla, R., Evans, N., & Zheng, T. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2222381 · Cited by 25
Metadata
- Authors
- Lin, C.-J.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2007-11
- Volume
- 18
- Issue
- 6
- Pages
- 1589-1596
- ISSN
- 1045-9227 (ISSN-L)
- 1941-0093
- OpenAlex
- W2132538571
- Cited by
- 416
- References
- 14
- FWCI
- 22.69
- 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.