{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:44:13Z","timestamp":1649108653950},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1995,12,1]],"date-time":"1995-12-01T00:00:00Z","timestamp":817776000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Neural Process Lett"],"published-print":{"date-parts":[[1995,12]]},"DOI":"10.1007\/bf02309008","type":"journal-article","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T02:11:40Z","timestamp":1139969500000},"page":"5-8","source":"Crossref","is-referenced-by-count":6,"title":["Iterative pruning in second-order recurrent neural networks"],"prefix":"10.1007","volume":"2","author":[{"given":"Giovanna","family":"Castellano","sequence":"first","affiliation":[]},{"given":"Anna Maria","family":"Fanelli","sequence":"additional","affiliation":[]},{"given":"Marcello","family":"Pelillo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02309008_CR1","first-page":"609","volume":"2","author":"L.B. Almeida","year":"1987","unstructured":"L.B. Almeida. A learning rule for asynchronous perceptrons with feedback in a combinatorial environment,Proc. Int. Conference on Neural Networks, San Diego, CA, vol. 2, pp. 609\u2013618, 1987.","journal-title":"Proc. Int. Conference on Neural Networks, San Diego, CA"},{"key":"BF02309008_CR2","volume-title":"Introduction to the theory of neural computation","author":"J. Hertz","year":"1991","unstructured":"J. Hertz, A. Krogh, R.G. Palmer.Introduction to the theory of neural computation. Addison-Wesley, Redwood City, CA, 1991."},{"issue":"no. 5","key":"BF02309008_CR3","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1109\/72.248452","volume":"4","author":"R. Reed","year":"1993","unstructured":"R. Reed. Pruning algorithms \u2014 a survey,IEEE Trans. on Neural Networks, vol.4, no. 5, pp. 740\u2013747, 1993.","journal-title":"IEEE Trans. on Neural Networks"},{"issue":"no. 5","key":"BF02309008_CR4","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1109\/72.317740","volume":"5","author":"C.L. Giles","year":"1994","unstructured":"C.L. Giles, C.W. Omlin. Pruning recurrent neural networks for improved generalization performance,IEEE Trans. on Neural Networks, vol. 5, no. 5, pp. 848\u2013851, 1994.","journal-title":"IEEE Trans. on Neural Networks"},{"key":"BF02309008_CR5","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-56798-4_160","volume-title":"New Trends in Neural Computation","author":"M. Pelillo","year":"1993","unstructured":"M. Pelillo, A. M. Fanelli. A method of pruning layered feed-forward neural networks,New Trends in Neural Computation, J. Mira, J. Cabestany, A. Prieto, eds., pp. 278\u2013283, Springer-Verlag, Berlin, 1993."},{"key":"BF02309008_CR6","doi-asserted-by":"crossref","unstructured":"G. Castellano, A.M. Fanelli, M. Pelillo. Pruning in recurrent neural networks,Proc. Int. Conf. on Artificial Neural Networks (Sorrento, Italy), pp. 451\u2013454, 1994.","DOI":"10.1007\/978-1-4471-2097-1_106"},{"key":"BF02309008_CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01930845","volume":"19","author":"A. Bj\u00f6rck","year":"1979","unstructured":"A. Bj\u00f6rck, T. Elfving. Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations,BIT vol. 19, 145\u2013163, 1979.","journal-title":"BIT"},{"issue":"no. 4","key":"BF02309008_CR8","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1142\/S0218001493000431","volume":"7","author":"C.B. Miller","year":"1993","unstructured":"C.B. Miller, C.L. Giles. Experimental comparison of the effect of order in recurrent neural networks,International Journal of Pattern Recognition and Artificial Intelligence, vol. 7, no. 4, pp. 849\u2013872, 1993.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"BF02309008_CR9","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1162\/neco.1992.4.3.393","volume":"4","author":"C.L. Giles","year":"1992","unstructured":"C.L. Giles, C.B. Miller, D. Chen, H.H. Chen, G.Z. Sun, Y.C. Lee. Learning and extracting finite state automata with second-order recurrent neural networks,Neural Computation, vol.4, pp. 393\u2013405, 1992.","journal-title":"Neural Computation"},{"key":"BF02309008_CR10","doi-asserted-by":"crossref","unstructured":"M. Tomita. Dynamic construction of finite-state automata from examples using hill-climbing,Proc. Fourth Annual Cognitive Science Conf., Ann Arbor, MI, pp. 105\u2013108, 1982.","DOI":"10.21236\/ADA120123"}],"container-title":["Neural Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02309008.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02309008\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02309008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T17:10:06Z","timestamp":1558026606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02309008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,12]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,12]]}},"alternative-id":["BF02309008"],"URL":"https:\/\/doi.org\/10.1007\/bf02309008","relation":{},"ISSN":["1370-4621","1573-773X"],"issn-type":[{"value":"1370-4621","type":"print"},{"value":"1573-773X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,12]]}}}