The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
Abstract
Nonnegative matrix factorization (NMF) determines a lower rank approximation of a matrix $A \in \mathbb{R}^{m \times n} \approx WH$ where an integer $k \ll \min(m,n)$ is given and nonnegativity is imposed on all components of the factors $W \in \mathbb{R}^{m \times k}$ and $H \in \mathbb{R}^{k \times n}$. NMF has attracted much attention for over a decade and has been successfully applied to numerous data analysis problems. In applications where the components of the data are necessarily nonnegative, such as chemical concentrations in experimental results or pixels in digital images, NMF provides a more relevant interpretation of the results since it gives nonsubtractive combinations of nonnegative basis vectors. In this paper, we introduce an algorithm for NMF based on alternating nonnegativity constrained least squares (NMF/ANLS) and the active set–based fast algorithm for nonnegativity constrained least squares with multiple right-hand side vectors, and we discuss its convergence properties and a rigorous convergence criterion based on the Karush–Kuhn–Tucker (KKT) conditions. In addition, we also describe algorithms for sparse NMFs and regularized NMF. We show how we impose a sparsity constraint on one of the factors by $L_1$-norm minimization and discuss its convergence properties. Our algorithms are compared to other commonly used NMF algorithms in the literature on several test data sets in terms of their convergence behavior.
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
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
Golub, T. R., Slonim, D. K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J. P., Coller, H., Loh, M. L., Downing, J. R., Caligiuri, M. A., et al. (1999) · Science · doi:10.1126/science.286.5439.531 · Cited by 11,516
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
Prediction of central nervous system embryonal tumour outcome based on gene expression
Pomeroy, S. L., Tamayo, P., Gaasenbeek, M., Sturla, L. M., Angelo, M., McLaughlin, M. E., Kim, J. Y. H., Goumnerova, L. C., Black, P. M., Lau, C., et al. (2002) · Nature · doi:10.1038/415436a · Cited by 2,371
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
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
Orthogonal nonnegative matrix t-factorizations for clustering
Ding, C., Li, T., Peng, W., & Park, H. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150420 · Cited by 1,245
Self-citationA 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-citationHoyer, P. O. (2003) · Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing · doi:10.1109/nnsp.2002.1030067 · Cited by 804
Learning 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
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
Nonsmooth nonnegative matrix factorization (nsNMF)
Pascual-Montano, A., Carazo, J. M., Kochi, K., Lehmann, D., & Pascual-Marqui, R. D. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.60 · Cited by 419
Improving molecular cancer class discovery through sparse non-negative matrix factorization
Gao, Y., & Church, G. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti653 · Cited by 339
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
Subsystem Identification Through Dimensionality Reduction of Large-Scale Gene Expression Data
Kim, P. M., & Tidor, B. (2003) · Genome Research · doi:10.1101/gr.903503 · Cited by 251
Fast 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
Accelerating 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
Non-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
Multi-way clustering of microarray data using probabilistic sparse matrix factorization
Dueck, D., Morris, Q., & Frey, B. J. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti1041 · Cited by 98
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
Sparse Non-negative Matrix Factorizations via Alternating Non-negativity-constrained Least Squares
Kim, H., & Park, H. (2006) · SMARTech Repository (Georgia Institute of Technology) · Cited by 17
Self-citation
Cited by
Alternating Minimization Algorithms for Hybrid Precoding in Millimeter Wave MIMO Systems
Yu, X., Shen, J.-C., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2523903 · Cited by 1,444
Xu, Y., & Yin, W. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/120887795 · Cited by 1,160
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
An Augmented Linear Mixing Model to Address Spectral Variability for Hyperspectral Unmixing
Hong, D., Yokoya, N., Chanussot, J., & Zhu, X. X. (2019) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2878958 · Cited by 948
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
Metadata
- Authors
- Kim, H., & Park, H.
- Venue
- SIAM Journal on Matrix Analysis and Applications
- Published
- 2008-01
- Volume
- 30
- Issue
- 2
- Pages
- 713-730
- ISSN
- 0895-4798 (ISSN-L)
- 1095-7162
- OpenAlex
- W2076566842
- Cited by
- 574
- References
- 29
- FWCI
- 23.87
- 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.