Empirical Data Modeling in Software Engineering Using Radial Basis Functions
IEEE Transactions on Software Engineering
Learning Classifier Systems, From Foundations to Applications
Dimensionality Reduction in Automatic Knowledge Acquisition: A Simple Greedy Search Approach
IEEE Transactions on Knowledge and Data Engineering
Benchmarking a Reduced Multivariate Polynomial Pattern Classifier
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modeling software component criticality using a machine learning approach
AIS'04 Proceedings of the 13th international conference on AI, Simulation, and Planning in High Autonomy Systems
Optimizing the kernel in the empirical feature space
IEEE Transactions on Neural Networks
| Hi-index | 0.00 |
Radial basis function (RBF) models have been successfully employed to study a broad range of data mining problems and benchmark data sets for real world scientific and engineering applications. In this paper we investigate RBF models with Gaussian kernels by developing classifiers in a systematic way. In particular, we employ our newly developed RBF design algorithm for a detailed performance study and sensitivity analysis of the classification models for the popular Monk’s problems. The results show that the accuracy of our classifiers is very impressive while our classification approach is systematic and easy to implement. In addition, differing complexity of the three Monk’s problems is clearly reflected in the classification error surfaces for test data. By exploring these surfaces, we acquire better understanding of the data mining classification problems. Finally, we study the error surfaces to investigate trade-offs between different choices of model parameters to develop efficient and parsimonious models for a given application.