Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Open Engineering

formerly Central European Journal of Engineering

Editor-in-Chief: Ritter, William


CiteScore 2018: 0.91

SCImago Journal Rank (SJR) 2018: 0.211
Source Normalized Impact per Paper (SNIP) 2018: 0.655

ICV 2018: 121.06

Open Access
Online
ISSN
2391-5439
See all formats and pricing
More options …

N-bit Parity Neural Networks with minimum number of threshold neurons

Marat Z. Arslanov
  • Institute of information and computation technologies, Almaty 050010, Pushkin str.125, Kazakhstan
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Zhazira E. Amirgalieva
  • Institute of information and computation technologies, Almaty 050010, Pushkin str.125, Kazakhstan
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
/ Chingiz A. Kenshimov
  • Institute of information and computation technologies, Almaty 050010, Pushkin str.125, Kazakhstan
  • Other articles by this author:
  • De Gruyter OnlineGoogle Scholar
Published Online: 2016-11-02 | DOI: https://doi.org/10.1515/eng-2016-0037

Abstract

In this paper ordered neural networks for the Nbit parity function containing [log2(N + 1)] threshold elements are constructed. The minimality of this network is proved. The connection between minimum perceptrons of Gamb for the N-bit parity function and one combinatorial problems is established.

Keywords: neural networks; XOR problem; perceptrons ofGamb

References

  • [1] Arslanov M.Z., Ashigaliev D.U., Ismail E.E., N-bit parity ordered networks, Neurocomputing, 2002, 48, 1053-1058. Google Scholar

  • [2] Brown D.A., N-bit parity networks, Neural Networks, 1993, 6, 607-608. CrossrefGoogle Scholar

  • [3] Dertouzos M.L., Threshold Logic, The M.I.T. Press, Cambridge, Massachusets, 1965. Google Scholar

  • [4] Hohil M.E., Liu D., Smith S.H., Solving the N-bit Parity Problem Using Neural Networks, Neural Networks, 1999, 12, 1321-1323. CrossrefGoogle Scholar

  • [5] Hohil M.E., Liu D., Smith S.H., N-bit parity networks: a simple solution, Proceedings of the 32nd Annual Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, 1998, 695-700. Google Scholar

  • [6] Lavretsky E., On the Exact Solution of the Parity - N Problem using ordered Neural Networks, Neural Networks, 2000, 13, 643- 649. Google Scholar

  • [7] Minor J.M., Parity with two layer feedforward nets, Neural Networks, 1993, 6, 705-707. CrossrefGoogle Scholar

  • [8] Minsky M., Papert P., Perseptrons, The M.I.T. Press, Cambridge, Massachusets, 1969. Google Scholar

  • [9] Setiono R., On the Solution of the Parity Problem by a Single Hidden layer Feedforward Neural Network, Neurocomputing, 1997, 16, 225-235. CrossrefGoogle Scholar

  • [10] Stork D.G., N-Bit Parity Networks: A Reply to Brown and Korn, Neural Networks , 1993,6, 609. Google Scholar

  • [11] Stork D.G., Allen J.D., How to solve the N-bit parity problem with two hidden units, Neural Networks 1992, 5, 923-926. CrossrefGoogle Scholar

About the article

Received: 2016-05-17

Accepted: 2016-06-24

Published Online: 2016-11-02


Citation Information: Open Engineering, Volume 6, Issue 1, ISSN (Online) 2391-5439, DOI: https://doi.org/10.1515/eng-2016-0037.

Export Citation

©2016 M.Z. Arslanov et al.. This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License. BY-NC-ND 3.0

Comments (0)

Please log in or register to comment.
Log in