Single layer morphological perceptron solution to the N-bit parity problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3287, Issue , 2004, Pages 171-178

  Urcid, Gonzalo ^b   Ritter, Gerhard X ^a   Iancu, Laurentiu ^b  

^a INSTITUTO NACIONAL DE ASTROFÍSICA   (Mexico)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; BENCHMARKING; CYBERNETICS; GEOMETRY; NEURAL NETWORKS;

BIT-STRINGS; CLASS PATTERNS; DENDRITIC STRUCTURES; EUCLIDEAN PLANES; LATTICE ALGEBRAS; PARITY PROBLEMS; SINGLE LAYER; TRAINING ALGORITHMS;

PATTERN RECOGNITION;

EID: 35048874697     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30463-0_21     Document Type: Article

References (19)

1. Thornton, C.: Parity: the problem that won't go away. Proc. of Artificial Intelligence, Toronto, Canada (1996) 362-374.
2. Sontag, E. D.: Feedforward nets for interpolation and classification. Journal of Computer and System Sciences 45 (1992) 20-48.
3. Duch W.: Scaling properties of neural classifiers. Proc. 3rd Conf. on Neural Networks and their Applications, Kule, Poland (1997) 663-670.
4. Setiono, R.: On the solution of the parity problem by using a single hidden layer feedforward neural network. Neurocomputing 16(3) (1997) 1059-1065.
5. Looney, C. G.: Pattern Recognition using Neural Networks. Theory and Algorithms for Engineers and Scientists. Oxford University Press, New York, USA (1997).
6. Setiono, R: Algorithmic techniques and their applications, in Neural Networks Systems, Techniques, and Applications, C. T. Leondes, Ed. Academic Press, San Diego, California, USA 5 (1998) 296-301.
7. Hjelmås, E.: A comment on the parity problem. Technical Report (7), Gjøvik University College, Norway (1999).
8. Park, C-Y., Nakajima K.: Majority algorithm: a formation for neural networks with the quantized connection weights. IEICE Trans. Fundamentals E83-A(6) (2000) 225-235.
9. Ghorbani, A. A., Owrangh K.: Stacked generalization in neural networks: generalization on statistically neutral problems. IEEE Proc. IJCNN, Washington, DC, USA (2001) 1715-1720.
10. Wilamowski, B. M. et al.: An algorithm for fast convergence in training neural networks. IEEE Proc. IJCNN, Washington, D.C., USA (2001) 1778-1782.
11. Liu, D., Chang T-S., Zhang Y.: A constructive algorithm for feedforward neural networks with incremental training. IEEE Trans, on Circuits and Systems 49(12) (2002) 1876-1879.
12. Ritter, G. X., Urcid, G., Selfridge R.:Minimax dendrite computation. ASME Proc. ANNIE, St. Louis Missouri, USA 12(2002) 75-80.
13. Ritter, G. X., Urcid G.: Lattice algebra approach to single neuron computation. IEEE Trans, on Neural Networks 14(2) (2003) 282-295.
14. Ritter, G. X., Iancu, L., Urcid G.: Morphological perceptrons with dendritic structure. Proc. FUZZ-IEEE, St. Louis, Missouri, USA (2003) 1296-1301.
15. Ritter, G. X., Iancu, L.: Lattice algebra approach to neural networks and pattern classification. Proc. 6th Open German-Russian Workshop on Pattern Recognition and Image Understanding, Katun Village, Altai Region, Russian Federation (2003) 18-21.
16. Ritter, G. X., Iancu, L., Urcid G.: Neurons, dendrites, and pattern recognition. Proc. 8th Iberoamerican Congress on Pattern Recognition, Havana, Cuba (2003) 1296-1301.
17. Ritter, G. X., Iancu, L.: Lattice algebra, dendritic computing, and pattern recognition. Invited tutorial, 8th Iberoamerican Congress on Pattern Recognition, Havana, Cuba (2003) 16-24.
18. Ash, T.: Dynamic node creation in backpropagation networks. Connectionist Science 1 (1989) 365-375.
19. Setiono, R., Hui, L. C. K.: Use of quasi-Newton method in a feedforward neural network construction algorithm. IEEE Transactions on Neural Networks 6 (1995) 273-277.