{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T05:13:21Z","timestamp":1739164401488,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642023965"},{"type":"electronic","value":"9783642023972"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02397-2_17","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:36:38Z","timestamp":1243935398000},"page":"145-153","source":"Crossref","is-referenced-by-count":1,"title":["Approaching the Time Dependent Cocktail Party Problem with Online Sparse Coding Neural Gas"],"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","reference":[{"issue":"9","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1875","DOI":"10.1162\/0899766054322964","volume":"17","author":"S. Haykin","year":"2005","unstructured":"Haykin, S., Chen, Z.: The cocktail party problem. Neural Comput.\u00a017(9), 1875\u20131902 (2005)","journal-title":"Neural Comput."},{"issue":"6","key":"17_CR2","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1162\/neco.1995.7.6.1129","volume":"7","author":"A.J. Bell","year":"1995","unstructured":"Bell, A.J., Sejnowski, T.J.: An information-maximization approach to blind separation and blind deconvolution. Neural Computation\u00a07(6), 1129\u20131159 (1995)","journal-title":"Neural Computation"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/72.761722","volume":"10","author":"A. Hyv\u00e4rinen","year":"1999","unstructured":"Hyv\u00e4rinen, A.: Fast and robust fixed-point algorithms for independent component analysis. IEEE Transactions on Neural Networks\u00a010(3), 626\u2013634 (1999)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Hyv\u00e4rinen, A., Cristescu, R., Oja, E.: A fast algorithm for estimating overcomplete ica bases for image windows. In: Proceedings of the International Joint Conference on Neural Networks, IJCNN 1999, vol.\u00a02, pp. 894\u2013899 (1999)","DOI":"10.1109\/IJCNN.1999.831071"},{"issue":"4","key":"17_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1109\/97.752062","volume":"6","author":"T.W. Lee","year":"1999","unstructured":"Lee, T.W., Lewicki, M., Girolami, M., Sejnowski, T.: Blind source separation of more sources than mixtures using overcomplete representations. IEEE Signal Processing Letters\u00a06(4), 87\u201390 (1999)","journal-title":"IEEE Signal Processing Letters"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1162\/089976600300015826","volume":"12","author":"M.S. Lewicki","year":"2000","unstructured":"Lewicki, M.S., Sejnowski, T.J.: Learning Overcomplete Representations. Neural Computation\u00a012(2), 337\u2013365 (2000)","journal-title":"Neural Computation"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.neucom.2003.09.008","volume":"56","author":"F. Theis","year":"2004","unstructured":"Theis, F., Lang, E., Puntonet, C.: A geometric algorithm for overcomplete linear ica. Neurocomputing\u00a056, 381\u2013398 (2004)","journal-title":"Neurocomputing"},{"issue":"6","key":"17_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/97.763148","volume":"6","author":"A. Hyv\u00e4rinen","year":"1999","unstructured":"Hyv\u00e4rinen, A.: Gaussian moments for noisy independent component analysis. IEEE Signal Processing Letters\u00a06(6), 145\u2013147 (1999)","journal-title":"IEEE Signal Processing Letters"},{"key":"17_CR9","unstructured":"Labusch, K., Barth, E., Martinetz, T.: Learning Data Representations with Sparse Coding Neural Gas. In: Verleysen, M. (ed.) Proceedings of the 16th European Symposium on Artificial Neural Networks, pp. 233\u2013238. D-Side Publishers (2008)"},{"issue":"7-9","key":"17_CR10","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., Martinetz, T.: Sparse Coding Neural Gas: Learning of Overcomplete Data Representations. Neurocomputing\u00a072(7-9), 1547\u20131555 (2009)","journal-title":"Neurocomputing"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1007\/978-3-540-87536-9_81","volume-title":"Artificial Neural Networks - ICANN 2008","author":"K. Labusch","year":"2008","unstructured":"Labusch, K., Barth, E., Martinetz, T.: Sparse Coding Neural Gas for the Separation of Noisy Overcomplete Sources. In: Koutn\u00edk, J., K\u016frkov\u00e1, V., Neruda, R. (eds.) ICANN 2008, Part I. LNCS, vol.\u00a05163, pp. 788\u2013797. Springer, Heidelberg (2008)"},{"key":"17_CR12","unstructured":"Pati, Y., Rezaiifar, R., Krishnaprasad, P.: Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In: Proceedings of the 27 th Annual Asilomar Conference on Signals, Systems (November 1993)"},{"issue":"1","key":"17_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/TIT.2005.860430","volume":"52","author":"D.L. Donoho","year":"2006","unstructured":"Donoho, D.L., Elad, M., Temlyakov, V.N.: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory\u00a052(1), 6\u201318 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S.S. Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing\u00a020(1), 33\u201361 (1998)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"4","key":"17_CR15","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., Lowe, D.: Optimized orthogonal matching pursuit approach. IEEE Signal Processing Letters\u00a09(4), 137\u2013140 (2002)","journal-title":"IEEE Signal Processing Letters"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF00275687","volume":"15","author":"E. Oja","year":"1982","unstructured":"Oja, E.: A simplified neuron model as a principal component analyzer. J. Math. Biol.\u00a015, 267\u2013273 (1982)","journal-title":"J. Math. Biol."},{"key":"17_CR17","first-page":"397","volume":"I","author":"T. Martinetz","year":"1991","unstructured":"Martinetz, T., Schulten, K.: A \u201cNeural-Gas Network\u201d Learns Topologies. Artificial Neural Networks\u00a0I, 397\u2013402 (1991)","journal-title":"Artificial Neural Networks"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/72.238311","volume":"4","author":"T. Martinetz","year":"1993","unstructured":"Martinetz, T., Berkovich, S., Schulten, K.: \u201cNeural-gas\u201d Network for Vector Quantization and its Application to Time-Series Prediction. IEEE-Transactions on Neural Networks\u00a04(4), 558\u2013569 (1993)","journal-title":"IEEE-Transactions on Neural Networks"},{"issue":"11","key":"17_CR19","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M. Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation. IEEE Transactions on Signal Processing\u00a054(11), 4311\u20134322 (2006); see also IEEE Transactions on Acoustics, Speech, and Signal Processing","journal-title":"IEEE Transactions on Signal Processing"}],"container-title":["Lecture Notes in Computer Science","Advances in Self-Organizing Maps"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02397-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,9]],"date-time":"2025-02-09T21:22:49Z","timestamp":1739136169000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02397-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023965","9783642023972"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02397-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}