Proc. SPIE 3722, Applications and Science of Computational Intelligence II, 402
Neural networks (Computer science), Neural networks -- Structure, System theory, Fourier transformations, Pattern recognition
We consider the problem of matching domain-specific statistical structure to neural-network (NN) architecture. In past work we have considered this problem in the function approximation context; here we consider the pattern classification context. General Systems Methodology tools for finding problem-domain structure suffer exponential scaling of computation with respect to the number of variables considered. Therefore we introduce the use of Extended Dependency Analysis (EDA), which scales only polynomially in the number of variables, for the desired analysis. Based on EDA, we demonstrate a number of NN pre-structuring techniques applicable for building neural classifiers. An example is provided in which EDA results in significant dimension reduction of the input space, as well as capability for direct design of an NN classifier.
This is the post-print version (author's manuscript).
The final published version is © (1999) Copyright Society of Photo-Optical Instrumentation Engineers (SPIE).
Final published version:
Systematic electronic or print reproduction and distribution, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper are prohibited.
George G. Lendaris ; Thaddeus T. Shannon ; Martin Zwick; Prestructuring neural networks via extended dependency analysis with application to pattern classification. [Post-print]. Proc. SPIE 3722, Applications and Science of Computational Intelligence II, 402 (March 22, 1999).