Show simple item record

dc.contributor.authorLabbé, Martine
dc.contributor.authorMartínez Merino, Luisa Isabel 
dc.contributor.authorRodríguez Chía, Antonio Manuel 
dc.contributor.otherEstadística e Investigación Operativaes_ES
dc.date.accessioned2024-03-12T09:27:54Z
dc.date.available2024-03-12T09:27:54Z
dc.date.issued2019
dc.identifier.issn0166-218X
dc.identifier.urihttp://hdl.handle.net/10498/31357
dc.description.abstractThis work focuses on support vector machine (SVM) with feature selection. A MILP formulation is proposed for the problem. The choice of suitable features to construct the separating hyperplanes has been modeled in this formulation by including a budget constraint that sets in advance a limit on the number of features to be used in the classification process. Wepropose both an exact and a heuristic procedure to solve this formulation in an efficient way. Finally, the validation of the model is done by checking it with some well-known data sets and comparing it with classical classification methods.es_ES
dc.formatapplication/pdfes_ES
dc.language.isoenges_ES
dc.publisherElsevieres_ES
dc.sourceDiscrete Applied Mathematics 261 (2019) 276–304es_ES
dc.subjectMathematical programminges_ES
dc.subjectKernel search algorithmes_ES
dc.subjectSupervised classificationes_ES
dc.subjectSupport vector machinees_ES
dc.subjectFeature selectiones_ES
dc.titleMixed integer linear programming for feature selection in support vector machinees_ES
dc.typejournal articlees_ES
dc.rights.accessRightsopen accesses_ES
dc.identifier.doi10.1016/j.dam.2018.10.025
dc.type.hasVersionAMes_ES


Files in this item

This item appears in the following Collection(s)

Show simple item record