Binarized Support Vector Machines Articles uri icon

authors

  • MARTIN BARRAGAN, BELEN
  • CARRIZOSA, EMILIO
  • ROMERO MORALES, DOLORES

publication date

  • June 2010

start page

  • 154

end page

  • 167

issue

  • 1

volume

  • 22

international standard serial number (ISSN)

  • 1091-9856

electronic international standard serial number (EISSN)

  • 1526-5528

abstract

  • The widely used support vector machine (SVM) method has shown to yield very good results in supervised classification problems. Other methods such as classification trees have become more popular among practitioners than SVM thanks to their interpretability, which is an important issue in data mining. In this work, we propose an SVM-based method that automatically detects the most important predictor variables and the role they play in the classifier. In particular, the proposed method is able to detect those values and intervals that are critical for the classification. The method involves the optimization of a linear programming problem in the spirit of the Lasso method with a large number of decision variables. The numerical experience reported shows that a rather direct use of the standard column generation strategy leads to a classification method that, in terms of classification ability, is competitive against the standard linear SVM and classification trees. Moreover, the proposed method is robust; i.e., it is stable in the presence of outliers and invariant to change of scale or measurement units of the predictor variables. When the complexity of the classifier is an important issue, a wrapper feature selection method is applied, yielding simpler but still competitive classifiers.