Lagrangian relaxation for SVM feature selection - Archive ouverte HAL Access content directly
Journal Articles Computers and Operations Research Year : 2017

Lagrangian relaxation for SVM feature selection

(1) , (2, 3) , (4, 5) , (6)
1
2
3
4
5
6

Abstract

We discuss a Lagrangian-relaxation-based heuristics for dealing with feature selection in the Support Vector Machine (SVM) framework for binary classification. In particular we embed into our objective function a weighted combination of the L1 and L0 norm of the normal to the separating hyperplane. We come out with a Mixed Binary Linear Programming problem which is suitable for a Lagrangian relaxation approach. Based on a property of the optimal multiplier setting, we apply a consolidated nonsmooth optimization ascent algorithm to solve the resulting Lagrangian dual. In the proposed approach we get, at every ascent step, both a lower bound on the optimal solution as well as a feasible solution at low computational cost. We present the results of our numerical experiments on some benchmark datasets.
Fichier principal
Vignette du fichier
Gaudiosoetal-preprint.pdf (583.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01666453 , version 1 (21-12-2017)

Identifiers

Cite

Manlio Gaudioso, Enrico Gorgone, Martine Labbé, Antonio Manuel Rodríguez-Chía. Lagrangian relaxation for SVM feature selection. Computers and Operations Research, 2017, 87, pp.137 - 145. ⟨10.1016/j.cor.2017.06.001⟩. ⟨hal-01666453⟩
112 View
251 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More