Abstract Views :297 |
PDF Views:0
Authors
Affiliations
1 Department of Computer Science, St. Xavier’s College (Autonomous), IN
2 Department of Computer Science, Kamaraj College, IN
Source
ICTACT Journal on Soft Computing, Vol 2, No 3 (2012), Pagination: 348-352
Abstract
Classification of large amount of data is a time consuming process but crucial for analysis and decision making. Radial Basis Function networks are widely used for classification and regression analysis. In this paper, we have studied the performance of RBF neural networks to classify the sales of cars based on the demand, using kernel density estimation algorithm which produces classification accuracy comparable to data classification accuracy provided by support vector machines. In this paper, we have proposed a new instance based data selection method where redundant instances are removed with help of a threshold thus improving the time complexity with improved classification accuracy. The instance based selection of the data set will help reduce the number of clusters formed thereby reduces the number of centers considered for building the RBF network. Further the efficiency of the training is improved by applying a hierarchical clustering technique to reduce the number of clusters formed at every step. The paper explains the algorithm used for classification and for conditioning the data. It also explains the complexities involved in classification of sales data for analysis and decision-making.
Keywords
Radial Basis Function Neural Network, Gradient Descent, Spherical Gaussian Function, Feature Extraction, Instance-Based Data Selection.
