title: Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data.
abstract: BACKGROUND
  Classification and variable selection play an important role in knowledge discovery in high-dimensional data. Although Support Vector Machine (SVM) algorithms are among the most powerful classification and prediction methods with a wide range of scientific applications, the SVM does not include automatic feature selection and therefore a number of feature selection procedures have been developed. Regularisation approaches extend SVM to a feature selection method in a flexible way using penalty functions like LASSO, SCAD and Elastic Net.We propose a novel penalty function for SVM classification tasks, Elastic SCAD, a combination of SCAD and ridge penalties which overcomes the limitations of each penalty alone.Since SVM models are extremely sensitive to the choice of tuning parameters, we adopted an interval search algorithm, which in comparison to a fixed grid search finds rapidly and more precisely a global optimal solution.
  
  
  RESULTS
  Feature selection methods with combined penalties (Elastic Net and Elastic SCAD SVMs) are more robust to a change of the model complexity than methods using single penalties. Our simulation study showed that Elastic SCAD SVM outperformed LASSO (L1) and SCAD SVMs. Moreover, Elastic SCAD SVM provided sparser classifiers in terms of median number of features selected than Elastic Net SVM and often better predicted than Elastic Net in terms of misclassification error.Finally, we applied the penalization methods described above on four publicly available breast cancer data sets. Elastic SCAD SVM was the only method providing robust classifiers in sparse and non-sparse situations.
  
  
  CONCLUSIONS
  The proposed Elastic SCAD SVM algorithm provides the advantages of the SCAD penalty and at the same time avoids sparsity limitations for non-sparse data. We were first to demonstrate that the integration of the interval search algorithm and penalized SVM classification techniques provides fast solutions on the optimization of tuning parameters.The penalized SVM classification algorithms as well as fixed grid and interval search for finding appropriate tuning parameters were implemented in our freely available R package 'penalizedSVM'.We conclude that the Elastic SCAD SVM is a flexible and robust tool for classification and feature selection tasks for high-dimensional data such as microarray data sets.
authors.affiliation: German Cancer Research Center, Division Molecular Genetics, INF 280, 69120 Heidelberg, Germany. natalia.becker@dkfz.de
authors.forename: Natalia
authors.initials: N
authors.lastname: Becker
authors.forename: Grischa
authors.initials: G
authors.lastname: Toedt
authors.forename: Peter
authors.initials: P
authors.lastname: Lichter
authors.forename: Axel
authors.initials: A
authors.lastname: Benner
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D001943:Breast Neoplasms / Q000175:diagnosis / Q000473:pathology; D002965:Classification / Q000379:methods*; D005822:Genetic Vectors; D006801:Humans; D008198:Lymph Nodes / Q000473:pathology; D046228:Microarray Analysis / Q000379:methods*; D009362:Neoplasm Metastasis / Q000473:pathology