Determination of optimal RBF network structure by canonical subspace analysis

Titus K. Y. Lo; John Litva; Henry Leung

doi:10.1117/12.152633

19 August 1993 Determination of optimal RBF network structure by canonical subspace analysis

Titus K. Y. Lo, John Litva, Henry Leung

Proceedings Volume 1966, Science of Artificial Neural Networks II; (1993) https://doi.org/10.1117/12.152633
Event: Optical Engineering and Photonics in Aerospace Sensing, 1993, Orlando, FL, United States

Abstract

An important consideration in designing an RBF network is the choice of the number of hidden units required for the network to generalize optimally. A new method, which is called canonical subspace analysis, is proposed for the selection of the number of hidden units. The numerical results show that with the number of the hidden units determined using the proposed method, minimum prediction errors are obtained.

Citation Download Citation

Titus K. Y. Lo, John Litva, and Henry Leung "Determination of optimal RBF network structure by canonical subspace analysis", Proc. SPIE 1966, Science of Artificial Neural Networks II, (19 August 1993); https://doi.org/10.1117/12.152633

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available