The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
Abstract
Nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used for numerous applications, including text mining, computer vision, pattern discovery, and bioinformatics. A mathematical formulation for NMF appears as a nonconvex 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 a limitation of the active set method. We introduce ideas that efficiently extend the block principal pivoting method within the context of NMF computation. Our algorithm inherits the convergence property of the ANLS framework and can easily be extended to other constrained NMF formulations. Extensive computational comparisons using data sets that are from real life applications as well as those artificially generated show that the proposed algorithm provides state-of-the-art performance in terms of computational speed.
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
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
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
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Lee, D. D., & Seung, H. S. (2000) · neural information processing systems · Cited by 9,873
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
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
Least squares formulation of robust non-negative factor analysis
Paatero, P. (1997) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/s0169-7439(96)00044-5 · Cited by 1,978
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
Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S. (2009) · doi:10.1002/9780470747278 · Cited by 1,540
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
A fast non-negativity-constrained least squares algorithm
Bro, R., & De Jong, S. (1997) · Journal of Chemometrics · doi:10.1002/(sici)1099-128x(199709/10)11:5<393::aid-cem483>3.0.co;2-l · Cited by 906
Kim, H., & Park, H. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm134 · Cited by 863
Self-citationLearning spatially localized, parts-based representation
Li, S. Z., Hou, X. W., Zhang, H. J., & Cheng, Q. S. (2005) · Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001 · doi:10.1109/cvpr.2001.990477 · Cited by 776
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
On the Complexity of Nonnegative Matrix Factorization
Vavasis, S. A. (2010) · SIAM Journal on Optimization · doi:10.1137/070709967 · Cited by 588
Nonnegative matrix factorization for spectral data analysis
Pauca, V. P., Piper, J., & Plemmons, R. J. (2006) · Linear Algebra and its Applications · doi:10.1016/j.laa.2005.06.025 · Cited by 584
Fast Local Algorithms for Large Scale Nonnegative Matrix and Tensor Factorizations
CICHOCKI, A., & PHAN, A.-H. (2009) · IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences · doi:10.1587/transfun.e92.a.708 · Cited by 575
Kim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
Self-citationGeneralized Nonnegative Matrix Approximations with Bregman Divergences
Sra, S., & Dhillon, I. S. (2005) · MPG.PuRe (Max Planck Society) · Cited by 523
Nonnegative Matrix Factorization: An Analytical and Interpretive Tool in Computational Biology
Devarajan, K. (2008) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000029 · Cited by 454
Text 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
Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
Cichocki, A., Zdunek, R., & Amari, S.-I. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74494-8_22 · Cited by 281
Sparse Nonnegative Matrix Factorization for Clustering
Kim, J., & Park, H. (2008) · SMARTech Repository (Georgia Institute of Technology) · Cited by 253
Self-citationFast algorithm for the solution of large‐scale non‐negativity‐constrained least squares problems
Van Benthem, M. H., & Keenan, M. R. (2004) · Journal of Chemometrics · doi:10.1002/cem.889 · Cited by 241
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
Self-citationAccelerating the Lee-Seung Algorithm for Nonnegative Matrix Factorization
Gonzalez, E. F., & Zhang, Y. (2005) · Rice Research Repository (Rice University) · Cited by 163
Fast 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
Portugal, L., Júdice, J. J., & Vicente, L. N. (1994) · Mathematics of Computation · doi:10.2307/2153286 · Cited by 96
Nonnegative Factorization and The Maximum Edge Biclique ProblemPreprint
Gillis, N., & Glineur, F. (2008) · arXiv (Cornell University) · doi:10.48550/arxiv.0810.4225 · Cited by 58
Júdice, J. J., & Pires, M. (1994) · Computers & Operations Research · doi:10.1016/0305-0548(94)90106-6 · Cited by 45
Tsnnls: A solver for large sparse least squares problems with non-negative variablesPreprint
Cantarella, J., & Piatek, M. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408029 · Cited by 31
Fast Active-set-type Algorithms for L1-regularized Linear Regression
Kim, J., & Park, H. (2010) · Cited by 26
Self-citation
Cited by
Fast and Efficient Estimation of Individual Ancestry Coefficients
Frichot, E., Mathieu, F., Trouillon, T., Bouchard, G., & François, O. (2014) · Genetics · doi:10.1534/genetics.113.160572 · Cited by 931
Kim, J., He, Y., & Park, H. (2014) · Journal of Global Optimization · doi:10.1007/s10898-013-0035-4 · Cited by 352
Self-citationWilliams, A. H., Kim, T. H., Wang, F., Vyas, S., Ryu, S. I., Shenoy, K. V., Schnitzer, M., Kolda, T. G., & Ganguli, S. (2018) · Neuron · doi:10.1016/j.neuron.2018.05.015 · Cited by 310
TESS3: fast inference of spatial population structure and genome scans for selection
Caye, K., Deist, T. M., Martins, H., Michel, O., & François, O. (2016) · Molecular Ecology Resources · doi:10.1111/1755-0998.12471 · Cited by 298
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
Metadata
- Authors
- Kim, J., & Park, H.
- Venue
- SIAM Journal on Scientific Computing
- Published
- 2011-01
- Volume
- 33
- Issue
- 6
- Pages
- 3261-3281
- ISSN
- 1064-8275 (ISSN-L)
- 1095-7197
- OpenAlex
- W2093492509
- Cited by
- 328
- References
- 34
- FWCI
- 23.46
- 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.