Original Contribution: How to solve the N-bit parity problem with two hidden units

  • Authors:
  • David G. Stork;James D. Allen

  • Affiliations:
  • -;-

  • Venue:
  • Neural Networks
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

We construct a three-layer feedforward network (one hidden layer) which can solve the N-bit parity problem employing just two hidden units. We discuss the implications of employing problem constraints into transfer functions for general pattern classification problems.