Feature selection is an important combinatorial optimisation problem in the context of supervised pattern classification.
This paper presents four novel continuous feature selection approaches directly minimising the classifier performance. In
particular, we include linear and nonlinear Support Vector Machine classifiers. The key ideas of our approaches are additional
regularisation and embedded nonlinear feature selection. To solve our optimisation problems, we apply difference of convex
functions programming which is a general framework for non-convex continuous optimisation. Experiments with artificial data
and with various real-world problems including organ classification in computed tomography scans demonstrate that our methods
accomplish the desired feature selection and classification performance simultaneously.
Keywords feature selection - SVMs - embedded methods - mathematical programming - difference of convex functions programming - non-convex optimisation
Editor: Dale Schuurmans