The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Sparse coding and NMF
Abstract
Non-negative matrix factorization (NMF) is a very efficient parameter-free method for decomposing multivariate data into strictly positive activations and basis vectors. However, the method is not suited for overcomplete representations, where usually sparse coding paradigms apply. We show how to merge the concepts of non-negative factorization with sparsity conditions. The result is a multiplicative algorithm that is comparable in efficiency to standard NMF, but that can be used to gain sensible solutions in the overcomplete cases. This is of interest e.g. for the case of learning and modeling of arrays of receptive fields arranged in a visual processing map, where an overcomplete representation is unavoidable.
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
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) · Cited by 7,952
Emergence of simple-cell receptive field properties by learning a sparse code for natural images
Olshausen, B. A., & Field, D. J. (1996) · Nature · doi:10.1038/381607a0 · Cited by 5,694
ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
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
Modeling receptive fields with non-negative sparse coding
Hoyer, P. O. (2003) · Neurocomputing · doi:10.1016/s0925-2312(02)00782-8 · Cited by 111
Sparse Coding with Invariance Constraints
Wersing, H., Eggert, J. P., & Körner, E. (2003) · Lecture notes in computer science · doi:10.1007/3-540-44989-2_46 · Cited by 30
Self-citation
Cited by
Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processing
Monga, V., Li, Y., & Eldar, Y. C. (2021) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.3016905 · Cited by 1,414
Deep Unfolding: Model-Based Inspiration of Novel Deep Architectures
Hershey, J. R., Roux, J. L., & Weninger, F. (2014) · arXiv · doi:10.48550/arxiv.1409.2574 · Cited by 412
“Sparse NMF (SNMF) [30] is used as a baseline, by optimizing the training objective, for each source, l .”
MethodRolX: structural role extraction & mining in large graphs
Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., & Li, L. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339723 · Cited by 376
Single-channel speech separation using sparse non-negative matrix factorization
Schmidt, M. N., & Olsson, R. K. (2006) · Interspeech 2006 · doi:10.21437/interspeech.2006-655 · Cited by 365
Automatic Relevance Determination in Nonnegative Matrix Factorization with the /spl beta/-Divergence
Tan, V. Y. F., & Fevotte, C. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.240 · Cited by 271
Metadata
- Authors
- Eggert, J., & Korner, E.
- Venue
- 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541)
- Publisher
- IEEE
- Published
- 2005-02-28
- Volume
- 4
- Pages
- 2529-2533
- OpenAlex
- W2130789253
- Cited by
- 272
- References
- 7
- FWCI
- 28.14
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Sparse coding and NMF. https://app.cochat.ai/papers/10.1109/ijcnn.2004.1381036
- The paper
- Eggert, J., & Korner, E. (2005). Sparse coding and NMF. 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541). https://doi.org/10.1109/ijcnn.2004.1381036
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.