The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
Abstract
Nonnegative matrix factorization (NMF) is a powerful matrix decomposition technique that approximates a nonnegative matrix by the product of two low-rank nonnegative matrix factors. It has been widely applied to signal processing, computer vision, and data mining. Traditional NMF solvers include the multiplicative update rule (MUR), the projected gradient method (PG), the projected nonnegative least squares (PNLS), and the active set method (AS). However, they suffer from one or some of the following three problems: slow convergence rate, numerical instability and nonconvergence. In this paper, we present a new efficient NeNMF solver to simultaneously overcome the aforementioned problems. It applies Nesterov's optimal gradient method to alternatively optimize one factor with another fixed. In particular, at each iteration round, the matrix factor is updated by using the PG method performed on a smartly chosen search point, where the step size is determined by the Lipschitz constant. Since NeNMF does not use the time consuming line search and converges optimally at rate in optimizing each matrix factor, it is superior to MUR and PG in terms of efficiency as well as approximation accuracy. Compared to PNLS and AS that suffer from numerical instability problem in the worst case, NeNMF overcomes this deficiency. In addition, NeNMF can be used to solve -norm, -norm and manifold regularized NMF with the optimal convergence rate. Numerical experiments on both synthetic and real-world datasets show the efficiency of NeNMF for NMF and its variants comparing to representative NMF solvers. Extensive experiments on document clustering suggest the effectiveness of NeNMF.
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
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Rockafellar, R. T. (1970) · Princeton University Press eBooks · doi:10.1515/9781400873173 · Cited by 10,801
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,873
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
Introductory Lectures on Convex Optimization: A Basic Course
Nesterov, Y. E. (2014) · Medical Entomology and Zoology · Cited by 3,557
Introductory Lectures on Convex Optimization
Nesterov, Y. (2004) · Applied Optimization · doi:10.1007/978-1-4419-8853-9 · Cited by 2,698
Weik, M. H. (2000) · Computer Science and Communications Dictionary · doi:10.1007/1-4020-0613-6_12436 · Cited by 2,570
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
Smooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
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
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
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
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
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
Geometric Mean for Subspace Selection
Tao, D., Li, X., Wu, X., & Maybank, S. J. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.70 · Cited by 583
Self-citationKim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
An accelerated gradient method for trace norm minimization
Ji, S., & Ye, J. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553434 · Cited by 517
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
Non-negative Matrix Factorization on Manifold
Cai, D., He, X., Wu, X., & Han, J. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.57 · Cited by 405
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
Self-citationText Mining using Non-Negative Matrix Factorizations
Pauca, V. P., Shahnaz, F., Berry, M. W., & Plemmons, R. J. (2004) · Proceedings of the 2004 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972740.45 · Cited by 302
New Algorithms for Non-Negative Matrix Factorization in Applications to Blind Source Separation
Cichocki, A. S., Zdunek, R., & Амари, Ш.-И. (2006) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2006.1661352 · Cited by 223
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Kim, J., & Park, H. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.149 · Cited by 220
Non-Negative Patch Alignment Framework
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2157359 · Cited by 181
Self-citationFast Newton-type Methods for the Least Squares Nonnegative Matrix Approximation Problem
Kim, D., Sra, S., & Dhillon, I. S. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.31 · Cited by 123
Sparse transfer learning for interactive video search reranking
Tian, X., Tao, D., & Rui, Y. (2012) · ACM Transactions on Multimedia Computing Communications and Applications · doi:10.1145/2240136.2240139 · Cited by 120
Self-citationNon-negative Matrix Factorization with Quasi-Newton Optimization
Zdunek, R., & Cichocki, A. S. (2006) · Lecture notes in computer science · doi:10.1007/11785231_91 · Cited by 113
Complex Object Correspondence Construction in Two-Dimensional Animation
Yu, J., Liu, D., Tao, D., & Seah, H. S. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2158225 · Cited by 111
Self-citationSubspaces Indexing Model on Grassmann Manifold for Image Search
Wang, X., Li, Z., & Tao, D. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2114354 · Cited by 106
Self-citationColor to Gray: Visual Cue Preservation
Song, M., Tao, D., Chen, C., et al. (2010) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2009.74 · Cited by 105
Self-citationAlternating projected Barzilai-Borwein methods for nonnegative matrix factorization.
Han, L., Neumann, M., & Prasad, U. (2009) · Cited by 32
Cited by
3-D Object Retrieval and Recognition With Hypergraph Analysis
Gao, Y., Wang, M., Tao, D., Ji, R., & Dai, Q. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2199502 · Cited by 633
Self-citationSingle Image Super-Resolution With Non-Local Means and Steering Kernel Regression
Zhang, K., Gao, X., Tao, D., & Li, X. (2012) · IEEE Transactions on Image Processing · doi:10.1109/tip.2012.2208977 · Cited by 576
Self-citationA Deep Matrix Factorization Method for Learning Attribute Representations
Trigeorgis, G., Bousmalis, K., Zafeiriou, S., & Schuller, B. W. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2554555 · Cited by 356
Understanding and Enhancement of Internal Clustering Validation Measures
Liu, Y., Li, Z., Xiong, H., Gao, X., Wu, J., & Wu, S. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2220543 · Cited by 315
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
Self-citation
Metadata
- Authors
- Guan, N., Tao, D., Luo, Z., & Yuan, B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2012-06
- Volume
- 60
- Issue
- 6
- Pages
- 2882-2898
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2155151262
- Cited by
- 468
- References
- 31
- FWCI
- 56.23
- 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.