Mixed Integer Linear Programming for Feature Selection in Support Vector Machine

08/07/2018
by   Martine Labbé, et al.
0

This 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 modelled 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. We propose 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2020

A novel embedded min-max approach for feature selection in nonlinear Support Vector Machine classification

In recent years, feature selection has become a challenging problem in s...
research
09/18/2016

Probabilistic Feature Selection and Classification Vector Machine

Sparse Bayesian learning is one of the state-of- the-art machine learnin...
research
09/12/2018

But How Does It Work in Theory? Linear SVM with Random Features

We prove that, under low noise assumptions, the support vector machine w...
research
11/06/2020

A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees

Several recent publications report advances in training optimal decision...
research
01/15/2018

Generalizing, Decoding, and Optimizing Support Vector Machine Classification

The classification of complex data usually requires the composition of p...
research
10/15/2016

Incremental One-Class Models for Data Classification

In this paper we outline a PhD research plan. This research contributes ...
research
02/22/2020

Checking Phylogenetic Decisiveness in Theory and in Practice

Suppose we have a set X consisting of n taxa and we are given informatio...

Please sign up or login with your details

Forgot password? Click here to reset