Laddar...
Graph Regularized Nonnegative Matrix Factorization with Sparse Coding
In this paper, we propose a sparseness constraint NMF method, named graph regularized matrix factorization with sparse coding (GRNMF_SC). By combining manifold learning and sparse coding techniques together, GRNMF_SC can efficiently extract the basic vectors from the data space, which preserves the...
Sparad:
Huvudupphovsmän: | , |
---|---|
Materialtyp: | Artigo |
Språk: | Inglês |
Publicerad: |
Hindawi Limited
2015-01-01
|
Serie: | Mathematical Problems in Engineering |
Länkar: | http://dx.doi.org/10.1155/2015/239589 |
Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|