The recursive deterministic perceptron neural network

Neural Networks

Volumn 11, Issue 9, 1998, Pages 1571-1588

  Tajine, Mohamed ^a   Elizondo, David ^a  

^a Faculté de Médecine   (France)

Author keywords

Classification problems; Convex hull; Decision region; Linear separability; NP completeness; Perceptron; Recursive deterministic perceptron; Transformation algorithm

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BACKPROPAGATION; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; DECISION THEORY; FEEDFORWARD NEURAL NETWORKS; MATHEMATICAL MODELS; PATTERN RECOGNITION; SET THEORY;

INTERMEDIATE NEURONS (IN); LINEAR SEPARABILITY (LS); RECURSIVE DETERMINISTIC PERCEPTRON (RDP) NEURAL NETWORKS;

MULTILAYER NEURAL NETWORKS;

ALGORITHM; ARTICLE; ARTIFICIAL NEURAL NETWORK; CLASSIFICATION; GEOMETRY; LINEAR SYSTEM; PRIORITY JOURNAL; PROBLEM SOLVING;

EID: 0032418223     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(98)00054-9     Document Type: Article

References (22)

1. Andrews, R., & Geva, S. (1995). Inserting and extracting knowledge from constrained error back-propagation networks. In Proceedings of the 6th Australian Conference on Neural Networks, NSW, Sydney, Australia.
2. Bose N.K., Garga A.K. Neural network design using voronoi diagrams. IEEE Transactions on Neural Networks. 4(5):1993;778-787.
3. Campbell C., Perez Vicente C. The target switch algorithm: a constructive learning procedure for feed-forward neural networks. Neural Computation. 7(6):1995;1245-1264.
4. Dasarathy B.W. Nosing around the neighborhood: a new system structure and classification rule for recognition in partially exposed environments. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2(1):1980;67-71.
5. Elizondo, D.A. (1997). The recursive determinist perceptron (RDP) and topology reduction strategies for neural networks. PhD thesis, Université Louis Pasteur, Strasbourg, France.
6. Fahlman, S., & Lebiere, C. (1990). The cascade correlation architecture. In D. Touretzky (Ed.), Advances in neural information processing systems (Vol. 2, pp. 524-532). San Mateo, CA: Morgan Kaufmann .
7. Fisher R. A. The use of multiple measurements in taxonomic problems. Annual Eugenics. 7(II):1936;179-188.
8. Gallant S. I. Perceptron-based learning algorithms. IEEE Transactions on Neural Networks. 1(2):1990;179-191.
9. Gates, G.W. (1972). The reduced nearest neighbor rule. IEEE Transactions on Information Theory, 431-433.
10. Gorman, & Sejnowski, T. (1988). Analysis of hidden units in a layered network trained to classify sonar targets. Neural Networks, 1(1).
11. Johnson D.S., Preparata F.P. The densest hemisphere problem. Theoretical Computer Science. 6:1978;93-107.
12. Kim J.H., Park S.K. The geometrical learning of binary neural networks. IEEE Transactions on Neural Networks. 6(1):1995;237-247.
13. Pop, E., & Diederich, J. (1994). Ruleneg: Rule-extraction from neural networks by step-wise negation, Technical report, Queensland University of Technology, Neurocomputing Research Center, Queensland, Australia.
14. Preparata, F.P., & Shamos, M. (1985). Computational geometry. An introduction. New York: Springer.
15. Rosenblatt, F. (1962). Principles of neurodynamics. Washington, DC: Spartan.
16. Rumelhart, D.E., McClelland, J.L., & The PDP Research Group (1986a). Parallel distributed processing (Vol. 1). Cambridge, MA: MIT Press.
17. Rumelhart, D.E., McClelland, J.L., & The PDP Research Group (1986b). Parallel distributed processing (Vol. 2). Cambridge, MA: MIT Press.
18. Stoer, J., & Witzgall, C. (1970). Convexity and optimization in finite dimensions I. Berlin: Springer.
19. Tajine, M., & Elizondo, D. (1996). Enhancing the perceptron neural network by using functional composition, Technical Report 96-07, Computer Science Department, Université Louis Pasteur, Strasbourg, France.
20. Tajine, M., & Elizondo, D. (1997). Geometrical properties of the recursive deterministic perceptron neural networks, Technical Report, Universite Louis Pastuer, 7, Rue Rene Descartes, F-67084 Strasbourg, France.
21. Tajine, M., Elizondo, D. Fiesler, E., & Korczak, J. (1997). The class of linear separability method. The European Symposium on Artificial Neural Networks (ESNN97), pp. 219-224. Brussels: D-facto Publications.
22. Thrun, S.B., Bala, J., Bloendorn, E., Bratko, I., Cestnik, B., Cheng, J., Jong, K.D., Dzeroski, S., Fahlman, S.E., Fisher, D., Hamann, R., Kaufman, K., Keller, S., Kononenko, I., Kreuziger, J., Michalski, R., Mitchell, T., Pachowicz, P., Reich, Y., Vafaie, H., de Welde, W.V., Wenzel, W., Wnek, J., & Zhang, J. (1991). The monks problems, a performance comparison of different learning algorithms, Technical Report CMU-CS-91-197, Carnegie Mellon University.