DocumentCode
313580
Title
Orthogonal functional basis neural network for functional approximation
Author
Chen, C. L Philip ; Cao, Y. ; LeClair, Steven R.
Author_Institution
Dept. of Comput. Sci. & Eng., Wright State Univ., Dayton, OH, USA
Volume
1
fYear
1997
fDate
9-12 Jun 1997
Firstpage
204
Abstract
Subset selection is a well-known technique for generating an efficient and effective neural network structure. The technique has been combined with regularization to improve the generalization performance of a neural network. In this paper, we show an incongruity involving subset selection and regularization. We present an approach to solve this dissonance wherein our subset selection is derived from a combination of functional basis. A more efficient training convergence speed is shown using the new basis which is derived from an `orthogonal-functional-basis´ transformation. With this transformation we propose a new orthogonal functional basis neural network structure which is not only more computationally tractable but also gives better generalization performance. Simulation studies are presented that demonstrate the performance, behavior, and advantages of the proposed network
Keywords
computational complexity; feedforward neural nets; function approximation; generalisation (artificial intelligence); computational tractability; dissonance; functional approximation; orthogonal functional basis neural network structure; orthogonal-functional-basis transformation; regularization; subset selection; Computational modeling; Computer networks; Computer science; Convergence; Diversity reception; Forward contracts; Least squares methods; Neural networks; Radial basis function networks; Working environment noise;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks,1997., International Conference on
Conference_Location
Houston, TX
Print_ISBN
0-7803-4122-8
Type
conf
DOI
10.1109/ICNN.1997.611665
Filename
611665
Link To Document