Automatic subspace clustering of high dimensional data for data mining applications
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Fast learning in networks of locally-tuned processing units
Neural Computation
Comparing support vector machines with Gaussian kernels to radialbasis function classifiers
IEEE Transactions on Signal Processing
Orthogonal least squares learning algorithm for radial basis function networks
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Selecting proper centers is important for constructing a radial basis function (RBF) neural network. Motivated by the idea of clustering according to density for data mining applications, the algorithm of unevenly partition of the input space is proposed in the paper. By combining the neighboring subsets with low density data, the ultimate clustering centers are selected as the hidden layer centers in RBF neural network. An example is presented to demonstrate the method proposed, and the results illustrate the comparative high accuracy RBF neural network with comparative short training time can be created by selecting the initial partition set and the upper limit for the number of data in one subinterval properly.