Share Email Print

Proceedings Paper

Computational problems in the linear perceptron: a possible solution--dynamic definition of net topology
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

With respect to Rosenblatt linear perceptron, two classical limitation theorems demonstrated by M. Minsky and S. Papert are discussed. These two theorems, `(Psi) One-in-a-box' and `(Psi) Parity,' ultimately concern the intrinsic limitations of parallel calculations in pattern recognition problems. We demonstrate a possible solution of these limitation problems by substituting the static definition of characteristic functions and of their domains in the `geometrical' perceptron, with their dynamic definition. This dynamic consists in the mutual redefinition of the characteristic function and of its domain depending on the matching with the input.

Paper Details

Date Published: 6 April 1995
PDF: 9 pages
Proc. SPIE 2492, Applications and Science of Artificial Neural Networks, (6 April 1995); doi: 10.1117/12.205098
Show Author Affiliations
Antonio Luigi Perrone, Univ. di Roma Tor Vergata (Italy)
Gianfranco Basti, Pontifical Gregorian Univ. (Italy)

Published in SPIE Proceedings Vol. 2492:
Applications and Science of Artificial Neural Networks
Steven K. Rogers; Dennis W. Ruck, Editor(s)

© SPIE. Terms of Use
Back to Top