Sparse and robust feature selection in SVM classification through ℓp-quasi-norms
- 21 July 2026
- journal article
- Published by Elsevier in Neurocomputing
- Vol. 701
Abstract
No abstract availableFunding Information
- Agencia Nacional de Investigación y Desarrollo
This publication has 40 references indexed in Scilit:
- Comprehensive review on twin support vector machinesAnnals of Operations Research, 2022
- Minimization of transformed $L_1$ L 1 penalty: theory, difference of convex function algorithm, and robust application in compressed sensingMathematical Programming, 2018
- Application of the sequential parametric convex approximation method to the design of robust trussesJournal of Global Optimization, 2016
- Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2–ℓ p minimizationComputational Optimization and Applications, 2013
- Mixed-norm linear support vector machineNeural Computing and Applications, 2012
- Adaptive feature selection via a new version of support vector machineNeural Computing and Applications, 2012
- A prognostic DNA signature for T1T2 node‐negative breast cancer patientsGenes, Chromosomes and Cancer, 2010
- A sequential parametric convex approximation method with applications to nonconvex truss topology design problemsJournal of Global Optimization, 2009
- Enhancing Sparsity by Reweighted ℓ 1 MinimizationJournal of Fourier Analysis and Applications, 2008
- Combined SVM-Based Feature Selection and ClassificationMachine Learning, 2005