Feature selection in machine learning: an exact penalty approach using a Difference of Convex function Algorithm - Université de Lorraine Access content directly
Journal Articles Machine Learning Year : 2015

Feature selection in machine learning: an exact penalty approach using a Difference of Convex function Algorithm

Abstract

We develop an exact penalty approach for feature selection in machine learning via the zero-norm \ell _{0}-regularization problem. Using a new result on exact penalty techniques we reformulate equivalently the original problem as a Difference of Convex (DC) functions program. This approach permits us to consider all the existing convex and nonconvex approximation approaches to treat the zero-norm in a unified view within DC programming and DCA framework. An efficient DCA scheme is investigated for the resulting DC program. The algorithm is implemented for feature selection in SVM, that requires solving one linear program at each iteration and enjoys interesting convergence properties. We perform an empirical comparison with some nonconvex approximation approaches, and show using several datasets from the UCI database/Challenging NIPS 2003 that the proposed algorithm is efficient in both feature selection and classification.

Dates and versions

hal-01636662 , version 1 (16-11-2017)

Identifiers

Cite

Hoai An Le Thi, Hoai Minh Le, Tao Pham Dinh. Feature selection in machine learning: an exact penalty approach using a Difference of Convex function Algorithm. Machine Learning, 2015, 101 (1-3), pp.163-186. ⟨10.1007/s10994-014-5455-y⟩. ⟨hal-01636662⟩
77 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More