Learning capability: Classical RBF network vs. SVM with Gaussian kernel

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Support Vector Machine (SVM) has recently been introduced as a new learning technique for solving variety of real-world applications based on statistical learning theory. The classical Radial Basis Function (RBF) network has similar structure as SVM with Gaussian kernel. In this paper we have compared the generalization performance of RBF network and SVM in classification problems. We applied Lagrangian differential gradient method for training and pruning RBF network. RBF network shows better generalization performance and computationally faster than SVM with Gaussian kernel, specially for large training data sets.

Cite

CITATION STYLE

APA

Debnath, R., & Takahashi, H. (2002). Learning capability: Classical RBF network vs. SVM with Gaussian kernel. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2358, pp. 293–302). Springer Verlag. https://doi.org/10.1007/3-540-48035-8_29

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free