Back to Search
Start Over
Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations.
- Source :
- IEEE Transactions on Information Theory; Jul2011, Vol. 57 Issue 7, p4689-4708, 20p
- Publication Year :
- 2011
-
Abstract
- Given a large number of basis functions that can be potentially more than the number of samples, we consider the problem of learning a sparse target function that can be expressed as a linear combination of a small number of these basis functions. We are interested in two closely related themes: numeration="bullet" continuation="restarts" feature selection, or identifying the basis functions with nonzero coefficients; [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189448
- Volume :
- 57
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Information Theory
- Publication Type :
- Academic Journal
- Accession number :
- 61750010
- Full Text :
- https://doi.org/10.1109/TIT.2011.2146690