Title
Ideal kernel tuning: Fast and scalable selection of the radial basis kernel spread for support vector classification
Abstract
A simple and fast method, named ideal kernel tuning, is proposed to select the radial basis kernel spread of the support vector machine for classification. The spread is selected directly from data, without any training nor test, in order to bring the kernel matrix nearer to the ideal kernel matrix, with values one for patterns of the same class and zero otherwise. To avoid scaling with the training set size, the kernel matrix is calculated for a small set of class prototypes. The selected spread can be used also for multi-class classification problems considering the two most populated classes. Compared to other 5 popular tuning algorithms, the proposed approach is a smart and efficient strategy whose performance is very near to the state-of-the-art, is 2–4 orders of magnitude faster and requires very little memory, scales better with the dataset size both in time and memory, and is able to classify medium-size datasets up to 70,000 training patterns, where other methods fail.
Year
DOI
Venue
2022
10.1016/j.neucom.2022.03.034
Neurocomputing
Keywords
DocType
Volume
Support vector machine,Classification,Model selection,RBF Kernel,Spread tuning
Journal
489
ISSN
Citations 
PageRank 
0925-2312
0
0.34
References 
Authors
0
5
Name
Order
Citations
PageRank
Ziad Akram-Ali-Hammouri100.34
Manuel Fernandez-Delgado200.34
Audi Albtoush300.34
Eva Cernadas439720.30
Senen Barro500.34