Combined SVM-based feature selection and classification

DOI10.1007/s10994-005-1505-9zbMath1137.90643MaRDI QIDQ5896777

Christoph Schnörr, Julia Neumann, Gabriele Drauschke

Publication date: 8 February 2006

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-005-1505-9

zbMATH Keywords

mathematical programming; feature selection; embedded methods; SVMs; difference of convex functions programming; non-convex optimisation

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

Related Items

Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets, A DC programming approach for solving the symmetric eigenvalue complementarity problem, Solve exactly an under determined linear system by minimizing least squares regularized with an \(\ell_0\) penalty, An efficient kernel matrix evaluation measure, Neighborhood rough set based heterogeneous feature subset selection, Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation, Feature selection via sensitivity analysis of SVM probabilistic outputs, Feature selection with dynamic mutual information, Optimization based DC programming and DCA for hierarchical clustering, Robust investment strategies with discrete asset choice constraints using DC programming, DC Programming Approach for a Class of Nonconvex Programs Involving l 0 Norm

Uses Software

• UCI-ml
• CPLEX
• Optimization Toolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum-support solutions of polyhedral concave programs^*
• Penalty/Barrier Multiplier Methods for Convex Programming Problems
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• The Concave-Convex Procedure
• 10.1162/153244303322753616
• 10.1162/153244303322753751
• Convex Analysis