An empirical improvement of the accuracy of RBF networks

Authors:
Hyontai Sug
Affiliations:
Dongseo University, Busan
Venue:
Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human
Year:
2009

Citing 12
Cited 0

Learning internal representations by error propagation

Parallel distributed processing: explorations in the microstructure of cognition, vol. 1
Small Sample Size Effects in Statistical Pattern Recognition: Recommendations for Practitioners

IEEE Transactions on Pattern Analysis and Machine Intelligence
C4.5: programs for machine learning

C4.5: programs for machine learning
Efficient progressive sampling

KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Approximation of continuous and discontinuous mappings by a growing neural RBF-based algorithm

Neural Networks
Neural Networks for Pattern Recognition

Neural Networks for Pattern Recognition
Artificial Neural Networks for Document Analysis and Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Introduction to Data Mining, (First Edition)

Introduction to Data Mining, (First Edition)
2008 Special Issue: Training neural network classifiers for medical decision making: The effects of imbalanced datasets on classification performance

Neural Networks
2008 Special Issue: Classifier performance estimation under the constraint of a finite sample size: Resampling schemes applied to neural network classifiers

Neural Networks
Evolutionary optimization of radial basis function classifiers for data mining applications

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A constructive algorithm to solve “convex recursive deletion” (CoRD) classification problems via two-layer perceptron networks

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Neural networks have been developed for machine learning and data mining tasks, and because data mining problems contain a large amount of data, sampling is a necessity for the success of the task. Radial basis function networks are one of representative neural network algorithms, and known to have good prediction accuracy in many applications, but it is not known to decide a proper sample size like other data mining algorithms, so the task of deciding proper sample sizes for the neural networks tends to be arbitrary. As the size of samples grows, the improvement in error rates becomes better slowly. But we cannot use larger and larger samples for the networks, because there is some fluctuation in accuracy depending on the samples. This paper suggests a progressive resampling technique to cope with the situation. The suggestion is proved by experiments with very promising results.