The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Non-negative sparse coding
Open accessAbstract
Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. We briefly describe the motivation behind this type of data representation and its relation to standard sparse coding and non-negative matrix factorization. We then give a simple yet efficient multiplicative algorithm for finding the optimal values of the hidden components. In addition, we show how the basis vectors can be learned from the observed data. Simulations demonstrate the effectiveness of the proposed method.
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
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,878
Independent Component Analysis
(2004) · Independent Component Analysis · doi:10.7551/mitpress/3717.003.0014 · Cited by 7,903
Paatero, P., & Tapper, U. (1994) · Environmetrics · doi:10.1002/env.3170050203 · Cited by 6,023
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 · cited 4×
“In this paper, we have defined non-negative sparse coding as a combination of sparse coding with the constraints of non-negative matrix factorization.”
BackgroundMethodInfluentialALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
Seung, D., & Lee, L.-W. (2001) · Cited by 4,753
Independent Component Analysis: Principles and Practice
(2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511624148 · Cited by 1,917
A multi-layer sparse coding network learns contour coding from natural images
Hoyer, P. O., & Hyvärinen, A. (2002) · Vision Research · doi:10.1016/s0042-6989(02)00017-2 · Cited by 158
Self-citationParra, L. C., Spence, C. D., Sajda, P., Ziehe, A., & Müller, K. (1999) · Cited by 145
Modeling receptive fields with non-negative sparse coding
Hoyer, P. O. (2003) · Neurocomputing · doi:10.1016/s0925-2312(02)00782-8 · Cited by 111
Self-citation
Cited by
Non-negative matrix factorization with sparseness constraints
Hoyer, P. O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0408058 · Cited by 2,591
Self-citationGraph Regularized Nonnegative Matrix Factorization for Data Representation
Cai, D., He, X., Han, J., & Huang, T. S. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.231 · Cited by 2,451
Online Learning for Matrix Factorization and Sparse Coding
Mairal, J., Bach, F., Ponce, J., & Sapiro, G. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0908.0050 · Cited by 2,258
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
Witten, D. M., Tibshirani, R., & Hastie, T. (2009) · Biostatistics · doi:10.1093/biostatistics/kxp008 · Cited by 1,535
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
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
Transfer Learning for Visual Categorization: A Survey
Shao, L., Zhu, F., & Li, X. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2330900 · Cited by 895
Non-negative matrix factorization for polyphonic music transcription
Smaragdis, P., & Brown, J. C. (2004) · 2003 IEEE Workshop on Applications of Signal Processing to Audio and Acoustics (IEEE Cat. No.03TH8684) · doi:10.1109/aspaa.2003.1285860 · Cited by 860
SVD based initialization: A head start for nonnegative matrix factorization
Boutsidis, C., & Gallopoulos, E. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.09.010 · Cited by 695
Document clustering using nonnegative matrix factorization
Shahnaz, F., Berry, M. W., Pauca, V. P., & Plemmons, R. J. (2006) · Information Processing & Management · doi:10.1016/j.ipm.2004.11.005 · Cited by 608
Hyperspectral Unmixing via $L_{1/2}$ Sparsity-Constrained Nonnegative Matrix Factorization
Qian, Y., Jia, S., Zhou, J., & Robles-Kelly, A. (2011) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2144605 · Cited by 598
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
Kim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
Sparse Representation Based Fisher Discrimination Dictionary Learning for Image Classification
Yang, M., Zhang, L., Feng, X., & Zhang, D. (2014) · International Journal of Computer Vision · doi:10.1007/s11263-014-0722-8 · Cited by 489
NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2012) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2012.2190406 · Cited by 468
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
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
On the Convergence of Multiplicative Update Algorithms for Nonnegative Matrix Factorization
Lin, C.-J. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.895831 · Cited by 416
Machine Learning for Detection and Diagnosis of Disease
Sajda, P. (2006) · Annual Review of Biomedical Engineering · doi:10.1146/annurev.bioeng.8.061505.095802 · Cited by 409
Non-negative Matrix Factorization on Manifold
Cai, D., He, X., Wu, X., & Han, J. (2008) · 2008 Eighth IEEE International Conference on Data Mining · doi:10.1109/icdm.2008.57 · Cited by 405
Manifold Regularized Sparse NMF for Hyperspectral Unmixing
Lu, X., Wu, H., Yuan, Y., Yan, P., & Li, X. (2013) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2012.2213825 · Cited by 394
Constrained Nonnegative Matrix Factorization for Hyperspectral Unmixing
Jia, S., & Qian, Y. (2009) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2008.2002882 · Cited by 369
Zafeiriou, S., Tefas, A., Buciu, I., & Pitas, I. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.873291 · Cited by 329
Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2105496 · Cited by 318
Online Nonnegative Matrix Factorization With Robust Stochastic Approximation
Guan, N., Tao, D., Luo, Z., & Yuan, B. (2012) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2012.2197827 · Cited by 287
Sensors and AI Techniques for Situational Awareness in Autonomous Ships: A Review
Thombre, S., Zhao, Z., Ramm-Schmidt, H., Vallet Garcia, J. M., Malkamaki, T., Nikolskiy, S., Hammarberg, T., Nuortie, H., H. Bhuiyan, M. Z., Sarkka, S., et al. (2022) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.3023957 · Cited by 283
Spectral Unmixing via Data-Guided Sparsity
Zhu, F., Wang, Y., Fan, B., Xiang, S., Meng, G., & Pan, C. (2014) · IEEE Transactions on Image Processing · doi:10.1109/tip.2014.2363423 · Cited by 276
Eggert, J., & Korner, E. (2005) · 2004 IEEE International Joint Conference on Neural Networks (IEEE Cat. No.04CH37541) · doi:10.1109/ijcnn.2004.1381036 · Cited by 272
Zhi, R., Flierl, M., Ruan, Q., & Kleijn, W. B. (2011) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2010.2044788 · Cited by 260
Hyperspectral Unmixing Using a Neural Network Autoencoder
Palsson, B., Sigurdsson, J., Sveinsson, J. R., & Ulfarsson, M. O. (2018) · IEEE Access · doi:10.1109/access.2018.2818280 · Cited by 256
Neural correlates of sparse coding and dimensionality reduction
Beyeler, M., Rounds, E. L., Carlson, K. D., Dutt, N., & Krichmar, J. L. (2019) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1006908 · Cited by 104
Exact and Consistent Interpretation for Piecewise Linear Neural Networks: A Closed Form Solution
Chu, L., Hu, X., Hu, J., Wang, L., & Pei, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220063 · Cited by 87
Metadata
- Authors
- Hoyer, P. O.
- Venue
- Proceedings of the 12th IEEE Workshop on Neural Networks for Signal Processing
- Publisher
- IEEE
- Published
- 2003-06-25
- Pages
- 557-565
- OpenAlex
- W2116216716
- Cited by
- 804
- References
- 11
- FWCI
- 53.89
- Type
- conference paper
- Language
- en
- Open access
- green
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.