Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 981

The DOI matches its Crossref record; 95 of the 95 references it cites were found in a registry or an index.

Nonnegative Matrix Factorization: A Comprehensive Review

Wang, Yu-Xiong, Zhang, Yu-Jin·2013·IEEE Transactions on Knowledge and Data Engineering
DOI 10.1109/tkde.2012.51
Open this paper in CoChat — free account

Abstract

Nonnegative Matrix Factorization (NMF), a relatively novel paradigm for dimensionality reduction, has been in the ascendant since its inception. It incorporates the nonnegativity constraint and thus obtains the parts-based representation as well as enhancing the interpretability of the issue correspondingly. This survey paper mainly focuses on the theoretical research into NMF over the last 5 years, where the principles, basic models, properties, and algorithms of NMF along with its various modifications, extensions, and generalizations are summarized systematically. The existing NMF algorithms are divided into four categories: Basic NMF (BNMF), Constrained NMF (CNMF), Structured NMF (SNMF), and Generalized NMF (GNMF), upon which the design principles, characteristics, problems, relationships, and evolution of these algorithms are presented and analyzed comprehensively. Some related work not on NMF that NMF should learn from or has connections with is involved too. Moreover, some open issues remained to be solved are discussed. Several relevant application areas of NMF are also briefly described. This survey aims to construct an integrated, state-of-the-art framework for NMF concept, from which the follow-up research may benefit.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tkde.2012.51

Cites

95 of 95 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 43

  1. 10.1109/ICASSP.2005.1416297 · doi:10.1109/icassp.2005.1416297
  2. 10.1137/1.9781611972795.58 · doi:10.1137/1.9781611972795.58
  3. gupta, 2010, Additive Non-Negative Matrix Factorization for Missing Data, arXiv preprint arXiv 1007 0380
  4. 10.1137/1016064 · doi:10.1137/1016064
  5. chu, 2004, Optimality, Computation, and Interpretation of Nonnegative Matrix Factorizations, Technical Report
  6. tropp, 2003, Literature Survey: Nonnegative Matrix Factorization, Technical Report
  7. 10.1109/ISSPIT.2007.4458186 · doi:10.1109/isspit.2007.4458186
  8. 10.1109/TASL.2010.2040784 · doi:10.1109/tasl.2010.2040784
  9. 10.1155/2008/764206 · doi:10.1155/2008/764206
  10. 2012, Non-Negative Matrix Factorization, Wikipedia
  11. 10.1109/CISS.2008.4558681 · doi:10.1109/ciss.2008.4558681
  12. theis, 2005, First Results on Uniqueness of Sparse Non-Negative Matrix Factorization, Proc 13th European Signal Processing Conf (EUSIPCO '05)
  13. 10.1016/j.patcog.2011.05.015 · doi:10.1016/j.patcog.2011.05.015
  14. 10.1109/ICASSP.2011.5946900 · doi:10.1109/icassp.2011.5946900
  15. 10.1109/MSP.2008.4408452 · doi:10.1109/msp.2008.4408452
  16. li, 2009, Bilinear Form-Based Non-Negative Matrix Set Factorization, Chinese J Computers, 32, 1536
  17. li, 2009, Non-Negative Matrix-Set Factorization, Journal of Electronic & Information Technology China, 31, 255
  18. zhang, 2006, Non-Negative Matrix Factorization on Kernels, Proc Ninth Pacific Rim Int'l Conf Artificial Intelligence, 4099, 404
  19. chen, 2008, A Novel Constraint Non-Negative Matrix Factorization Criterion Based Incremental Learning in Face Recognition, Proc Int Conf Wavelet Analysis and Pattern Recognition, 1, 292
  20. 10.1145/1772690.1772760 · doi:10.1145/1772690.1772760
  21. 10.1016/j.patcog.2011.03.023 · doi:10.1016/j.patcog.2011.03.023
  22. 10.1016/j.sigpro.2010.01.019 · doi:10.1016/j.sigpro.2010.01.019
  23. 10.1142/S0129065707001275 · doi:10.1142/s0129065707001275
  24. 10.1109/ICPR.2008.4761256 · doi:10.1109/icpr.2008.4761256
  25. 10.1117/1.3184771 · doi:10.1117/1.3184771
  26. 10.1145/1008992.1009029 · doi:10.1145/1008992.1009029
  27. 10.3724/SP.J.1004.2010.00023 · doi:10.3724/sp.j.1004.2010.00023
  28. 10.1109/ICASSP.2007.366320 · doi:10.1109/icassp.2007.366320
  29. 10.1016/j.patrec.2011.01.012 · doi:10.1016/j.patrec.2011.01.012
  30. shen, 2010, Nonnegative Matrix Factorization Clustering on Multiple Manifolds, Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 575, 10.1609/aaai.v24i1.7664 · doi:10.1609/aaai.v24i1.7664
  31. 10.5244/C.23.9 · doi:10.5244/c.23.9
  32. buciu, 2008, Non-Negative Matrix Factorization, a New Tool for Feature Extraction: Theory and Applications, Int J Comput Commun Control, 3, 67
  33. chu, 2005, Nonnegative Matrix Factorization and Applications, Bull of the Int'l Linear Algebra Soc, 34, 2
  34. sra, 2006, Nonnegative Matrix Approximation: Algorithms and Applications, Technical Report
  35. drakakis, 2008, Analysis of Financial Data Using Non-Negative Matrix Factorization, Int Math Forum, 3, 1853
  36. 10.1016/j.engappai.2006.03.001 · doi:10.1016/j.engappai.2006.03.001
  37. 10.1016/j.amc.2008.05.106 · doi:10.1016/j.amc.2008.05.106
  38. langville, 2006, Initializations for the Nonnegative Matrix Factorization, Proc 12th ACM SIGKDD Int'l Conf Knowledge Discovery and Data Mining
  39. janecek, 2011, Using Population Based Algorithms for Initializing Nonnegative Matrix Factorization, Advances in Swarm Intelligence, 6729, 307, 10.1007/978-3-642-21524-7_37 · doi:10.1007/978-3-642-21524-7_37
  40. 10.1109/SSIAI.2008.4512287 · doi:10.1109/ssiai.2008.4512287
  41. 10.1007/s10618-010-0196-4 · doi:10.1007/s10618-010-0196-4
  42. 10.1049/el:20060983 · doi:10.1049/el:20060983
  43. 10.1109/ISSPIT.2009.5407557 · doi:10.1109/isspit.2009.5407557

Cited by

See all 981

Metadata

Authors
Wang, Y.-X., & Zhang, Y.-J.
Venue
IEEE Transactions on Knowledge and Data Engineering
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published
2013-06
Volume
25
Issue
6
Pages
1336-1353
ISSN
1041-4347 (ISSN-L)
DOI
10.1109/tkde.2012.51
OpenAlex
W2144359569
Cited by
981
References
95
FWCI
28.52
Type
journal article
Language
en
Open access
closed
Licence
ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html (vor)

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.