On the implementation of RBF technique in neural networks

An approach for the implementation of the Radial Basis Function (RBF) technique is presented and applied to a net work of the appropriate architecture. The paper explores the extent to which the number of RBF nodes can be reduced without significantly affecting the overall training error. This is accomplished through an effective clustering algorithm that shall be described in detail. Emphasis is also placed on the problems faced by a technique that has been proved superior to the more traditional training algorithms, particularly in terms of processing speed and solvability of nonlinear patterns. Solutions are consequently proposed in view of making RBF a more efficient method for interpolation and classification purposes.