Non-negative sparse coding

Abstract

Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper 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.

DOI: 10.1109/NNSP.2002.1030067

Extracted Key Phrases

1 Figure or Table

020406080'03'05'07'09'11'13'15'17
Citations per Year

708 Citations

Semantic Scholar estimates that this publication has 708 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Hoyer2002NonnegativeSC, title={Non-negative sparse coding}, author={Patrik O. Hoyer}, booktitle={NNSP}, year={2002} }