Non-negative sparse coding
Patrik O. Hoyer · 2003
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.
Cited by 804 works. doi:10.1109/nnsp.2002.1030067 Open-access PDF
Authors
References
- Learning the parts of objects by non-negative matrix factorization
- Emergence of simple-cell receptive field properties by learning a sparse code for natural images
- Independent Component Analysis
- Algorithms for Non-negative Matrix Factorization
- ALGORITHMS FOR NON-NEGATIVE MATRIX FACTORIZATION
- Positive matrix factorization: A non‐negative factor model with optimal utilization of error estimates of data values
- Independent Component Analysis
- Development of low entropy coding in a recurrent network
- A multi-layer sparse coding network learns contour coding from natural images
- Conditions for nonnegative independent component analysis