{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:08:46Z","timestamp":1742936926164,"version":"3.40.3"},"publisher-location":"Heidelberg","reference-count":8,"publisher":"Physica-Verlag HD","isbn-type":[{"type":"print","value":"9783790826036"},{"type":"electronic","value":"9783790826043"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-7908-2604-3_30","type":"book-chapter","created":{"date-parts":[[2010,11,8]],"date-time":"2010-11-08T10:41:11Z","timestamp":1289212871000},"page":"327-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Bag of Pursuits and Neural Gas for Improved Sparse Coding"],"prefix":"10.1007","author":[{"given":"Kai","family":"Labusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erhardt","family":"Barth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Martinetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,30]]},"reference":[{"issue":"11","key":"30_CR1","first-page":"4311","volume":"54","author":"M. Aharon","year":"2006","unstructured":"AHARON, M., ELAD, M. and BRUCKSTEIN. A. (2006): K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation. IEEE Transactions on Signal Processing,[see also IEEE Transactions on Acoustics, Speech, and Signal Processing], 54(11):4311\u20134322.","journal-title":"IEEE Transactions on Signal Processing,[see also IEEE Transactions on Acoustics, Speech, and Signal Processing]"},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02678430","volume":"13","author":"G. Davis","year":"1997","unstructured":"DAVIS, G., MALLAT, S. and AVELLANEDA. M. (1997): Greedy adaptive approximation. J. Constr. Approx., 13:57\u201389.","journal-title":"J. Constr. Approx."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"K. ENGAN, K., AASE, S. O. and HAKON HUSOY., J. (1999): Method of optimal directions for frame design. In ICASSP \u201999: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, pages 2443\u20132446, Washington, DC, USA, 1999. IEEE Computer Society.","DOI":"10.1109\/ICASSP.1999.760624"},{"issue":"7-9","key":"30_CR4","doi-asserted-by":"publisher","first-page":"1547","DOI":"10.1016\/j.neucom.2008.11.027","volume":"72","author":"K. Labusch","year":"2009","unstructured":"LABUSCH, K., BARTH, E. and MARTINETZ. T. (2009): Sparse Coding Neural Gas: Learning of Overcomplete Data Representations. Neurocomputing, 72(7-9):1547\u20131555.","journal-title":"Neurocomputing"},{"issue":"4","key":"30_CR5","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/72.238311","volume":"4","author":"T. Martinetz","year":"1993","unstructured":"MARTINETZ, T., BERKOVICH, S. and SCHULTEN. K. (1993): \u201cNeural-gas\u201d Network for Vector Quantization and its Application to Time-Series Prediction. IEEE-Transactions on Neural Networks, 4(4):558\u2013569.","journal-title":"IEEE-Transactions on Neural Networks"},{"key":"30_CR6","unstructured":"PATI, Y., REZAIIFAR, R. and KRISHNAPRASAD. P. (1993): Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition. Proceedings of the 27 th Annual Asilomar Conference on Signals, Systems, and Computers."},{"issue":"4","key":"30_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1109\/LSP.2002.1001652","volume":"9","author":"L. Rebollo-Neira","year":"2002","unstructured":"REBOLLO-NEIRA, L. and LOWE. D. (2002): Optimized orthogonal matching pursuit approach. IEEE Signal Processing Letters, 9(4):137\u2013140.","journal-title":"IEEE Signal Processing Letters"},{"issue":"10","key":"30_CR8","doi-asserted-by":"publisher","first-page":"2231","DOI":"10.1109\/TIT.2004.834793","volume":"50","author":"J. A. Tropp","year":"2004","unstructured":"TROPP. J. A. (2004): Greed is good: algorithmic results for sparse approximation. IEEE Transactions on Information Theory, 50(10):2231\u20132242.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Proceedings of COMPSTAT'2010"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-7908-2604-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,3]],"date-time":"2024-05-03T16:06:53Z","timestamp":1714752413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-7908-2604-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783790826036","9783790826043"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-7908-2604-3_30","relation":{},"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"30 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}