The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Non-Negative Matrix Factorization Revisited: Uniqueness and Algorithm for Symmetric Decomposition
Abstract
Non-negative matrix factorization (NMF) has found numerous applications, due to its ability to provide interpretable decompositions. Perhaps surprisingly, existing results regarding its uniqueness properties are rather limited, and there is much room for improvement in terms of algorithms as well. Uniqueness aspects of NMF are revisited here from a geometrical point of view. Both symmetric and asymmetric NMF are considered, the former being tantamount to element-wise non-negative square-root factorization of positive semidefinite matrices. New uniqueness results are derived, e.g., it is shown that a sufficient condition for uniqueness is that the conic hull of the latent factors is a superset of a particular second-order cone. Checking this condition is shown to be NP-complete; yet this and other results offer insights on the role of latent sparsity in this context. On the computational side, a new algorithm for symmetric NMF is proposed, which is very different from existing ones. It alternates between Procrustes rotation and projection onto the non-negative orthant to find a non-negative matrix close to the span of the dominant subspace. Simulation results show promising performance with respect to the state-of-art. Finally, the new algorithm is applied to a clustering problem for co-authorship data, yielding meaningful and interpretable results.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
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
A Generalized Solution of the Orthogonal Procrustes Problem
Schönemann, P. H. (1966) · Psychometrika · doi:10.1007/bf02289451 · Cited by 2,040
Kuhn, H. W., & Tucker, A. W. (1951) · Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability · doi:10.1525/9780520411586-036 · Cited by 1,985
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
On the Equivalence of Nonnegative Matrix Factorization and Spectral Clustering
Ding, C., He, X., & Simon, H. D. (2005) · Proceedings of the 2005 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972757.70 · Cited by 985
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
Advances in Neural Information Processing Systems 15 (NIPS 2002)
Williams, C. K. I., & Shawe-Taylor, J. S. (2002) · The MIT Press eBooks · Cited by 620
On the Complexity of Nonnegative Matrix Factorization
Vavasis, S. A. (2010) · SIAM Journal on Optimization · doi:10.1137/070709967 · Cited by 588
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
Minimum Volume Simplex Analysis: A Fast Algorithm to Unmix Hyperspectral Data
Li, J., & Bioucas-Dias, J. M. (2008) · IGARSS 2008 - 2008 IEEE International Geoscience and Remote Sensing Symposium · doi:10.1109/igarss.2008.4779330 · Cited by 394
Fast Nonnegative Matrix Factorization: An Active-Set-Like Method and Comparisons
Kim, J., & Park, H. (2011) · SIAM Journal on Scientific Computing · doi:10.1137/110821172 · Cited by 328
Sepanski, M. R. (2007) · Springer eBooks · doi:10.1007/978-0-387-49158-5 · Cited by 215
Fast Nonnegative Matrix/Tensor Factorization Based on Low-Rank Approximation
Zhou, G., Cichocki, A., & Xie, S. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2190410 · Cited by 160
On the computational complexity of membership problems for the completely positive cone and its dual
Dickinson, P. J. C., & Gijben, L. (2013) · Computational Optimization and Applications · doi:10.1007/s10589-013-9594-z · Cited by 159
Generating All Vertices of a Polyhedron Is Hard
Khachiyan, L. G., Boros, E., Borys, K., Elbassioni, K., & Gurvich, V. (2008) · Discrete & Computational Geometry · doi:10.1007/s00454-008-9050-5 · Cited by 137
Nonnegative matrix factorization with constrained second-order optimization
Zdunek, R., & Cichocki, A. S. (2007) · Signal Processing · doi:10.1016/j.sigpro.2007.01.024 · Cited by 97
Low-Dimensional Polytope Approximation and Its Applications to Nonnegative Matrix Factorization
Chu, M. T., & Lin, M. M. (2008) · SIAM Journal on Scientific Computing · doi:10.1137/070680436 · Cited by 30
Towards unique solutions of non-negative matrix factorization problems by a determinant criterion
Schachtner, R., Pöppel, G., & Lang, E. W. (2011) · Digital Signal Processing · doi:10.1016/j.dsp.2011.02.001 · Cited by 20
Cited by
Tensor Decomposition for Signal Processing and Machine Learning
Sidiropoulos, N. D., De Lathauwer, L., Fu, X., Huang, K., Papalexakis, E. E., & Faloutsos, C. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690524 · Cited by 1,617
Self-citationUncovering 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
Metadata
- Authors
- Huang, K., Sidiropoulos, N. D., & Swami, A.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2014-01
- Volume
- 62
- Issue
- 1
- Pages
- 211-224
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2070135644
- Cited by
- 264
- References
- 27
- FWCI
- 23.05
- 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.