{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:37:02Z","timestamp":1725536222597},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642030390"},{"type":"electronic","value":"9783642030406"}],"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-03040-6_21","type":"book-chapter","created":{"date-parts":[[2009,7,30]],"date-time":"2009-07-30T08:16:37Z","timestamp":1248941797000},"page":"171-178","source":"Crossref","is-referenced-by-count":0,"title":["Feature Detection by Structural Enhanced Information"],"prefix":"10.1007","author":[{"given":"Ryotaro","family":"Kamimura","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/09540098908915626","volume":"1","author":"M.C. Mozer","year":"1989","unstructured":"Mozer, M.C., Smolensky, P.: Using relevance to reduce network size automatically. Connection Science\u00a01(1), 3\u201316 (1989)","journal-title":"Connection Science"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/72.80236","volume":"1","author":"E.D. Karnin","year":"1990","unstructured":"Karnin, E.D.: A simple procedure for pruning back-propagation trained networks. IEEE transactions on neural networks\u00a01(2), 239\u2013242 (1990)","journal-title":"IEEE transactions on neural networks"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Reed, R.: Pruning algorithms-a survey. IEEE Transactions on Neural Networks\u00a04(5) (1993)","DOI":"10.1109\/72.248452"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/ICNN.1988.23839","volume-title":"Proceedings of IEEE International Conference on Neural Networks","author":"D. DeSieno","year":"1988","unstructured":"DeSieno, D.: Adding a conscience to competitive learning. In: Proceedings of IEEE International Conference on Neural Networks, San Diego, pp. 117\u2013124. IEEE, Los Alamitos (1988)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0893-6080(90)90071-R","volume":"3","author":"S.C. Ahalt","year":"1990","unstructured":"Ahalt, S.C., Krishnamurthy, A.K., Chen, P., Melton, D.E.: Competitive learning algorithms for vector quantization. Neural Networks\u00a03, 277\u2013290 (1990)","journal-title":"Neural Networks"},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1109\/72.238318","volume":"4","author":"L. Xu","year":"1993","unstructured":"Xu, L.: Rival penalized competitive learning for clustering analysis, RBF net, and curve detection. IEEE Transaction on Neural Networks\u00a04(4), 636\u2013649 (1993)","journal-title":"IEEE Transaction on Neural Networks"},{"key":"21_CR7","first-page":"1180","volume-title":"Proceedings of International conference on neural information processing","author":"A. Luk","year":"2000","unstructured":"Luk, A., Lien, S.: Properties of the generalized lotto-type competitive learning. In: Proceedings of International conference on neural information processing, San Mateo, CA, pp. 1180\u20131185. Morgan Kaufmann Publishers, San Francisco (2000)"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1162\/neco.1997.9.3.595","volume":"9","author":"M.M.V. Hulle","year":"1997","unstructured":"Hulle, M.M.V.: The formation of topographic maps that maximize the average mutual information of the output responses to noiseless input signals. Neural Computation\u00a09(3), 595\u2013606 (1997)","journal-title":"Neural Computation"},{"key":"21_CR9","first-page":"185","volume-title":"Proceedings of ESANN 1998, 6th European Symposium on Artificial Neural Networks","author":"S. Kaski","year":"1998","unstructured":"Kaski, S., Nikkil\u00e4, J., Kohonen, T.: Methods for interpreting a self-organized map in data analysis. In: Verleysen, M. (ed.) Proceedings of ESANN 1998, 6th European Symposium on Artificial Neural Networks, Bruges, April 22\u201324, 1998, pp. 185\u2013190. D-Facto, Brussels (1998)"},{"key":"21_CR10","first-page":"586","volume":"11","author":"J. Vesanto","year":"2000","unstructured":"Vesanto, J., Alhoniemi, E.: Clustering of the self-organizing map. IEEE-NN\u00a011, 586 (2000)","journal-title":"IEEE-NN"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S1088-467X(99)00013-X","volume":"3","author":"J. Vesanto","year":"1999","unstructured":"Vesanto, J.: SOM-based data visualization methods. Intelligent-Data-Analysis\u00a03, 111\u2013126 (1999)","journal-title":"Intelligent-Data-Analysis"},{"key":"21_CR12","first-page":"1415","volume":"3","author":"K. Torkkola","year":"2003","unstructured":"Torkkola, K.: Feature extraction by non-parametric mutual information maximization. Journal of Machine Learning Research\u00a03, 1415\u20131438 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"21_CR13","unstructured":"Slonim, N., Tishby, N.: Agglomerative information bottleneck (1999)"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/2.36","volume":"21","author":"R. Linsker","year":"1988","unstructured":"Linsker, R.: Self-organization in a perceptual network. Computer\u00a021, 105\u2013117 (1988)","journal-title":"Computer"},{"issue":"4","key":"21_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1080\/09540090110108679","volume":"13","author":"R. Kamimura","year":"2001","unstructured":"Kamimura, R., Kamimura, T., Uchida, O.: Flexible feature discovery and structural information. Connection Science\u00a013(4), 323\u2013347 (2001)","journal-title":"Connection Science"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1023\/B:NEPL.0000011136.78760.22","volume":"18","author":"R. Kamimura","year":"2003","unstructured":"Kamimura, R.: Information-theoretic competitive learning with inverse euclidean distance. Neural Processing Letters\u00a018, 163\u2013184 (2003)","journal-title":"Neural Processing Letters"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1207\/s15516709cog0901_5","volume":"9","author":"D.E. Rumelhart","year":"1985","unstructured":"Rumelhart, D.E., Zipser, D.: Feature discovery by competitive learning. Cognitive Science\u00a09, 75\u2013112 (1985)","journal-title":"Cognitive Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Neuro-Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03040-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T02:23:52Z","timestamp":1552098232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03040-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642030390","9783642030406"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03040-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}