Data Classification With Radial Basis Function Networks Based on a Novel Kernel Density Estimation Algorithm
| Autor: | Yen-Jen Oyang, Zhi-Wei Chen, Chien-Yu Chen, Shien-Ching Hwang, Yu-Yen Ou |
|---|---|
| Rok vydání: | 2005 |
| Předmět: |
Databases
Factual Wake-sleep algorithm Computer Networks and Communications Computer science Population-based incremental learning Data classification Kernel density estimation Stability (learning theory) Information Storage and Retrieval Semi-supervised learning computer.software_genre Computing Methodologies Pattern Recognition Automated Artificial Intelligence Cluster Analysis One-class classification Radial basis function FSA-Red Algorithm Weighted Majority Algorithm Training set Artificial neural network business.industry Online machine learning Pattern recognition General Medicine Generalization error Computer Science Applications Support vector machine Algorithm design Neural Networks Computer Artificial intelligence Data mining business computer Algorithm Algorithms Software |
| Zdroj: | IEEE Transactions on Neural Networks. 16:225-236 |
| ISSN: | 1045-9227 |
| DOI: | 10.1109/tnn.2004.836229 |
| Popis: | This work presents a novel learning algorithm for efficient construction of the radial basis function (RBF) networks that can deliver the same level of accuracy as the support vector machines (SVMs) in data classification applications. The proposed learning algorithm works by constructing one RBF subnetwork to approximate the probability density function of each class of objects in the training data set. With respect to algorithm design, the main distinction of the proposed learning algorithm is the novel kernel density estimation algorithm that features an average time complexity of O(nlogn), where n is the number of samples in the training data set. One important advantage of the proposed learning algorithm, in comparison with the SVM, is that the proposed learning algorithm generally takes far less time to construct a data classifier with an optimized parameter setting. This feature is of significance for many contemporary applications, in particular, for those applications in which new objects are continuously added into an already large database. Another desirable feature of the proposed learning algorithm is that the RBF networks constructed are capable of carrying out data classification with more than two classes of objects in one single run. In other words, unlike with the SVM, there is no need to resort to mechanisms such as one-against-one or one-against-all for handling datasets with more than two classes of objects. The comparison with SVM is of particular interest, because it has been shown in a number of recent studies that SVM generally are able to deliver higher classification accuracy than the other existing data classification algorithms. As the proposed learning algorithm is instance-based, the data reduction issue is also addressed in this paper. One interesting observation in this regard is that, for all three data sets used in data reduction experiments, the number of training samples remaining after a na/spl inodot//spl uml/ve data reduction mechanism is applied is quite close to the number of support vectors identified by the SVM software. This paper also compares the performance of the RBF networks constructed with the proposed learning algorithm and those constructed with a conventional cluster-based learning algorithm. The most interesting observation learned is that, with respect to data classification, the distributions of training samples near the boundaries between different classes of objects carry more crucial information than the distributions of samples in the inner parts of the clusters. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|