J. Alcaraz Soria

The Support Vector Machine is a well-known technique used in supervised
classification. To introduce the selection of features has several benefits but adds
complexity and makes the problem harder. Given that the SVM problem is a multiobjective
problem, obtaining the Pareto front gives the decision maker a wide variety of
solutions where to choose. The only metaheuristic that has been developed to solve
the problem and give an approximation of such a front is a NSGA-II based technique.
However, the design of such technique presents some limitations that are analyzed in
this paper. We present a new metaheuristic that has been completely redesigned in
order to overcome those drawbacks. We compare both techniques through an
extensive computational experiment that demonstrates the superior efficiency of the
new technique.

Keywords: Metaheuristics, Support Vector Machine, Feature Selection


GT10.HEUR1 Invited Session
November 7, 2023  4:50 PM
HC3: Canónigos Room 3

Other papers in the same session

Avances en la mejora de procesos en un problema del sector de laminados de acero

Ó. Soto-Sánchez, M. Sierra-Paradinas, M. Gallego, F. J. Martín Campo, F. Gortázar, A. Alonso-Ayuso

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.