A mixed integer linear programming support vector machine for cost-effective feature selection

In Gyu Lee

doi:10.1016/j.knosys.2020.106145

Return

A mixed integer linear programming support vector machine for cost-effective feature selection

2020-09-01

PRE

DOI：10.1016/j.knosys.2020.106145

Original

Original request for help

Save

Abstract

En 中文

In the era of big data, feature selection is indispensable as a dimensional reduction technique to lower data complexity and enhance machine learning performances. However, traditional feature selection methods mainly focus on classification performances, while they exclude the impact of associated feature costs; e.g., price, risk, and computational complexity for feature acquisition. In this research, we extend the l(1) norm support vector machine (l(1)-SVM) to address the feature costs, by incorporating a budget constraint to preserve classification accuracy with the least expensive features. Furthermore, we formulate its robust counterpart to address the uncertainty of the feature costs. To enhance computational efficiency, we also develop an algorithm to tighten the bound of the weight vector in the budget constraint. Through the experimental study on a variety of benchmark and synthetic datasets, our proposed mixed integer linear programming (MILP) models show that they can achieve competitive outcomes in terms of predictive and economic performances. Also, the algorithm that tightens the budget constraint helps to curtail computational complexity. (C) 2020 Elsevier B.V. All rights reserved.

Keywords:

Feature selection

Support vector machine

Mixed integer linear programming

Robust optimization

Feature cost

Cost uncertainty

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.