Share Email Print

Proceedings Paper

Removing and adding network connections with recursive-error-minimization equations
Author(s): Wayne E. Simon; Jeffrey R. Carter
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

One of the key features of Recursive Error Minimization (REM) equations is the efficient computation of the second derivative of mean square error with respect to each connection. The approximate integration of this derivative provides an estimate of the effect of removing or adding connections. A network with a minimum number of connections can then be found for a specific learning task. This has two important consequences. First the explanation of network decisions is much simpler with a minimum net. Second the computational load is a function of the number of connections. Results are presented for learning the English alphabet and for a simpler task learning the first seven letters of the alphabet. 1.

Paper Details

Date Published: 1 August 1990
PDF: 7 pages
Proc. SPIE 1294, Applications of Artificial Neural Networks, (1 August 1990); doi: 10.1117/12.21210
Show Author Affiliations
Wayne E. Simon, Martin Marietta Astronautics G (United States)
Jeffrey R. Carter, Martin Marietta Astronautics G (United States)

Published in SPIE Proceedings Vol. 1294:
Applications of Artificial Neural Networks
Steven K. Rogers, Editor(s)

© SPIE. Terms of Use
Back to Top