This paper explores the possibility of constructing RBF classifiers which, somewhat like support vector machines, use a reduced number of samples as centroids, by means of selecting samples in a direct way. Because sample selection is viewed as a hard computational problem, this selection is done after a previous vector quantization: this way obtaining also other similar machines using centroid...

Presents a systematic approach for constructing reformulated radial basis function (RBF) neural networks, which was developed to facilitate their training by supervised learning algorithms based on gradient descent. This approach reduces the construction of radial basis function models to the selection of admissible generator functions. The selection of generator functions relies on the concept...

We consider positive de nite and radial functions. After giving general results concerning the smoothness of general positive de nite and radial functions, we investigate the class of compactly supported, positive de nite, and radial functions, where every function consists of a univariate polynomial within its support. Especially, we show that these functions necessarily possess an even number...

In this paper a two phases learning algorithm with a modified kernel for radial basis function neural networks is proposed for classification. In phase one a new meta-heuristic approach differential evolution is used to reveal the parameters of the modified kernel. The second phase focuses on optimization of weights for learning the networks. Further, a predefined set of basis functions is take...

Radial basis function (RBF) approximation is an extremely powerful tool for representing smooth functions in non-trivial geometries, since the method is meshfree and can be spectrally accurate. A perceived practical obstacle is that the interpolation matrix becomes increasingly illconditioned as the RBF shape parameter becomes small, corresponding to flat RBFs. Two stable approaches that overco...

Bayesian methods have been successfully applied to regression and classification problems in multi-layer perceptrons. We present a novel application of Bayesian techniques to Radial Basis Function networks by developing a Gaussian approximation to the posterior distribution which, for fixed basis function widths, is analytic in the parameters. The setting of regularization constants by crossval...

This paper presents a new approach for the Radial Basis Function (RBF) interpolation of a vector field. Standard approaches for interpolation randomly select points for interpolation. Our approach uses the knowledge of vector field topology and selects points for interpolation according to the critical points location. We presents the results of interpolation errors on a vector field generated ...

What is now known as the Gibbs phenomenon was first observed in the context of truncated Fourier expansions, but other versions of it arise also in situations such as truncated integral transforms and for different interpolation methods. Radial basis functions (RBF) is a modern interpolation technique which includes both splines and trigonometric interpolations as special cases in 1-D, and it g...

We review characterizations of (conditional) positive definiteness and show how they apply to the theory of radial basis functions. We then give complete proofs for the (conditional) positive definiteness of all practically relevant basis functions. Furthermore, we show how some of these characterizations may lead to construction tools for positive definite functions. Finally, we give new const...

High-dimensional visualization is usually connected with large data processing. Because of dimensionality, it is nearly impossible to make a tessellation, like the Delaunay tessellation in E, followed by data interpolation. One possibility of data interpolation is the use of the Radial Basis Functions (RBF) interpolation. The RBF interpolation supports the interpolation of scattered data in d-d...