Journal
SOFT COMPUTING
Volume -, Issue -, Pages -Publisher
SPRINGER
DOI: 10.1007/s00500-023-08839-w
Keywords
Sparse optimization; Mixed integer problem; K-norm; Fractional programming; Multi-objective machine learning
Ask authors/readers for more resources
This study proposes a novel Mixed-Integer Nonlinear Programming (MINLP) model for sparse optimization based on the polyhedral k-norm. The focus is specifically on the application of sparse optimization in Feature Selection for Support Vector Machine (SVM) classification. The study addresses the continuous relaxation problem through reformulation via DC (Difference of Convex) decomposition. Additionally, it provides an overview of SVM models and related Feature Selection in terms of multi-objective optimization, and reports the results of numerical experiments on benchmark classification datasets.
We propose a novel Mixed-Integer Nonlinear Programming (MINLP) model for sparse optimization based on the polyhedral k-norm. We put special emphasis on the application of sparse optimization in Feature Selection for Support Vector Machine (SVM) classification. We address the continuous relaxation of the problem, which comes out in the form of a fractional programming problem (FPP). In particular, we consider a possible way for tackling FPP by reformulating it via a DC (Difference of Convex) decomposition. We also overview the SVM models and the related Feature Selection in terms of multi-objective optimization. The results of some numerical experiments on benchmark classification datasets are reported.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available