1. S. J. Hanson and D. J. Burr, “What Connectionists Models Learn: Learning and Representation in Connectionists Networks”, Behavioral and Brain Sciences, Vol. 13, Nr. 3, pp. 471–518, 1990.
2. S. J. Nowlan and G. E. Hinton, “Simplifying Neural Networks by Soft Weight-Sharing”, Neural Computation, Vol. 4, Nr. 4, July 1992.
3. W. Banzhaf et al., “A Sparsely Connected Asymmetric Neural Network and its Possible Application to the Processing of Transient Spatio-Temporal Signals”, Proceedings of the International Neural Network Conference (INNC) 90, Vol. 2, pp. 1005–1008, Kluwer Academic, 1990.
4. D. E. Rumelhart and J. L. McClelland, Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Vol. 1, Chap. 8, pp. 318–362, MIT Press, Cambridge, MA, 1986.
5. S. B. Thrun et al., “The MONK’s Problems: A Performance Comparison of Different Learning Algorithms”, Carnegie Mellon University Technical Report CMU-CS-91-197, December 1991.