Generalization and selection of examples in feedforward neural networks

Neural Computation

Volumn 12, Issue 10, 2000, Pages 2405-2426

  Franco, Leonardo ^a   Cannas, Sergio A ^a  

^a UNIVERSIDAD NACIONAL DE CÓRDOBA   (Argentina)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; ARTIFICIAL NEURAL NETWORK; FEEDBACK SYSTEM; NERVE CELL; PHYSIOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; FEEDBACK; NEURAL NETWORKS (COMPUTER); NEURONS;

EID: 0034293035     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976600300014999     Document Type: Article

References (18)

1. Baum, E. B. (1991). Neural net algorithms that learn in polynomial time from examples and queries. IEEE Transactions on Neural Networks, 2(1), 5.
2. Baum, E. B., & Haussler, D. (1989). What net size gives valid generalization? Neural Computation, 2(1), 151.
3. Boers, E. J. W., Kuiper, H., Happel, B. L. M., & Sprinkhuizen-Kuyper, I. G. (1993). Designing modular artificial neural networks. In H. A. Wijshoff (Ed.), Proceedings of Computing Science in the Netherlands (CSN'93) (p. 87). Amsterdam: SION, Stichting Matematisch Centrum.
4. Cannas, S. A. (1995). Arithmetic perceptrons. Neural Computation, 7(1), 173.
5. Cohn, D. (1996). Neural network exploration using optimal experiment design. Neural Networks, 9(6), 1071.
6. Cohn, D., Atlas, L., & Ladner, R. (1994). Improving generalization with active learning. Machine Learning, 15(2), 201.
7. Copelli, M., & Caticha, N. (1995). On-line learning in the committee machine. J. Phys. A: Math. Gen., 28, 1615.
8. Franco, L., & Cannas, S. A. (1998). Solving arithmetic problems using feed-forward neural networks. Neurocomputing, 18, 61-79.
9. Hancock, T. R., Golea, M., & Marchand, M. (1994). Learning nonoverlapping perceptron networks from examples and membership queries. Machine Learning, 16, 161.
10. Haykin, S. (1994). Neural networks: A comprehensive foundation. New York: McMillan.
11. Hertz, J., Krogh, A., & Palmer, R. (1991). Introduction to the theory of neural computation. Reading, MA: Addison-Wesley and Santa Fe Institute.
12. Jung, G., & Opper, M. (1996). Selection of examples for a linear classifier. J. Phys. A: Math. Gen., 29(7), 1367.
13. Kinzel, W., & Ruján, P. (1990). Improving a network generalization ability by selecting examples. Europhysics Letters, 13(5), 473.
14. Minsky, M. L., & Papert, S. A. (1969). Perceptrons. Cambridge, MA: MIT Press.
15. Plutowski, M., & White, H. (1993). Selecting concise training sets from clean data. IEEE Transactions on Neural Networks, 4(2), 305.
16. Priel, A., Blatt, M., Grossman, T., Domany, E., & Kanter, I. (1994). Computational capabilities of restricted two layered perceptrons. Physical Review E, 50, 577.
17. Rumelhart, D. E., & McClelland, J. L. (1986). Parallel distributed processing (Vol. 1). Cambridge, MA: MIT Press.
18. Tessauro, G., & Janssens, R. (1988). Scaling relationships in back-propagation learning: Dependence on predicate order (Tech. Rep. No. CCSR-88-1). Urbana-Champaign, IL: Center for Complex System Research.