A Faster Gradient Ascent Learning Algorithm for Nonlinear SVM. (25th August 2013)

• Record Type: Journal Article
• Authors: Cocianu, Catalina-Lucia; State, Luminita; Mircea, Marinela; Vlamos, Panayiotis
• Other Names: He S. Academic Editor.; Wu L. Academic Editor.
• Is Part Of: ISRN applied mathematics. Volume 2013(2013)
• Publication Date: 2013-08-25
• Subjects: Mathematics -- Periodicals; Mathematics; Periodicals; Electronic journals; 510
• DOI: 10.1155/2013/520635
• Languages: English
• ISSNs: 2090-5564

Abstract

Abstract : We propose a refined gradient ascent method including heuristic parameters for solving the dual problem of nonlinear SVM. Aiming to get better tuning to the particular training sequence, the proposed refinement consists of the use of heuristically established weights in correcting the search direction at each step of the learning algorithm that evolves in the feature space. We propose three variants for computing the correcting weights, their effectiveness being analyzed on experimental basis in the final part of the paper. The tests pointed out good convergence properties, and moreover, the proposed modified variants proved higher convergence rates as compared to Platt's SMO algorithm. The experimental analysis aimed to derive conclusions on the recognition rate as well as on the generalization capacities. The learning phase of the SVM involved linearly separable samples randomly generated from Gaussian repartitions and the WINE and WDBC datasets. The generalization capacities in case of artificial data were evaluated by several tests performed on new linearly/nonlinearly separable data coming from the same classes. The tests pointed out high recognition rates (about 97%) on artificial datasets and even higher recognition rates in case of the WDBC dataset.