Abstract
A solution to the N-bit parity problem employing a single multiplicative neuron model, called translated multiplicative neuron (π t -neuron), is proposed. The π t -neuron presents the following advantages: (a) ∀N≥1, only 1 π t -neuron is necessary, with a threshold activation function and parameters defined within a specific interval; (b) no learning procedures are required; and (c) the computational cost is the same as the one associated with a simple McCulloch-Pitts neuron. Therefore, the π t -neuron solution to the N-bit parity problem has the lowest computational cost among the neural solutions presented to date.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arslanov, M. Z., Ashigaliev, D. U. and Ismail, E. E.: N-bit parity ordered neural networks, Neurocomputing 48 (2002), 1053–1056.
Brown, D. A.: N-bit parity networks, Neural Networks 6 (1993), 607–608.
Giles, C. L. and Maxwell, T.: Learning, invariance, and generalization in high-order neural networks, Applied Optics 26(23) (1987), 4972–4978.
Iyoda, E. M., Hirota, K. and Von Zuben, F. J.: Sigma-Pi cascade extended hybrid neural networks, Journal of Advanced Computational Intelligence 6(3) (2002), 126–134.
Iyoda, E. M., Nobuhara, H. and Hirota, K.: Translated multiplicative neuron: An extended multiplicative neuron that can translate decision surfaces, In: Proceedings of the IEEE International Conference on Computational Cybernetics, Siófok, Hungary, 2003.
Lavretsky, E.: On the exact solution of the Parity-N problem using ordered neural networks, Neural Networks 13(6) (2000), 643–649.
Liu, D., Hohil, M. E. and Smith, S. H.: N-bit parity neural networks: new solutions based on linear programming, Neurocomputing 48 (2002), 477–488.
Minor, J. M.: Parity with two layer feedforward nets, Neural Networks 6(5) (1993), 705–707.
Schmitt, M.: On the complexity of computing and learning with multiplicative neurons, Neural Computating 14(2) (2002), 241–301.
Setiono, R.: On the solution of the parity problem by a single hidden layer feedforward neural network, Neurocomputing 16(3) (1997), 225–235.
Stork, D. G. and Allen, J. D.: How to solve the N-bit parity problem with two hidden units, Neural Networks 5(2) (1992), 923–926.
Torres-Moreno, J. M., Aguilar, J. C. and Gordon, M. B.: The minimum number of errors in the N-parity and its solution with an incremental neural network, Neural Processing Letters 16(3) (2002), 201–210.
Zhang, B.-T.: A Bayesian evolutionary approach to the design and learning of heterogeneous neural trees, Integrated Computer-Aided Engineering 9(1) (2002), 73–86.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Iyoda, E.M., Nobuhara, H. & Hirota, K. A Solution for the N-bit Parity Problem Using a Single Translated Multiplicative Neuron. Neural Processing Letters 18, 233–238 (2003). https://doi.org/10.1023/B:NEPL.0000011147.74207.8c
Issue Date:
DOI: https://doi.org/10.1023/B:NEPL.0000011147.74207.8c