In this paper we propose a novel approach for modeling kernels in Radial Basis Function networks. The method provides an extra degree of flexibility to the kernel structure. This flexibility comes through the use of modifier functions applied to the distance computation procedure, essential for all kernel evaluations. Initially the classifier uses an unsupervised method to construct the network topology, where most parameters of the network are defined without any customization from the user. During the second phase only one parameter per kernel is estimated. Experimental evidence on four datasets shows that the algorithm is robust and competitive. r 2006 Elsevier B.V. All rights reserved.
[1]
Sung Yang Bang,et al.
An Efficient Method to Construct a Radial Basis Function Neural Network Classifier
,
1997,
Neural Networks.
[2]
Florian Metze,et al.
Generalized radial basis function networks for classification and novelty detection: self-organization of optimal Bayesian decision
,
2000,
Neural Networks.
[3]
Daming Shi,et al.
Sensitivity analysis applied to the construction of radial basis function networks
,
2005,
Neural Networks.
[4]
Chih-Jen Lin,et al.
A comparison of methods for multiclass support vector machines
,
2002,
IEEE Trans. Neural Networks.