Second order cone programming formulations for feature selection
From MaRDI portal
Recommendations
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Feature Selection via Mathematical Programming
- Feature selection combining linear support vector machines and concave optimization
- Learning the optimal kernel for Fisher discriminant analysis via second order cone programming
- Feature selection for support vector machines via mixed integer linear programming
Cited in
(16)- Budget constrained non-monotonic feature selection
- A multi-class SVM approach based on the \( l_1\)-norm minimization of the distances between the reduced convex hulls
- Feature scaling via second-order cone programming
- Distributionally robust optimization. A review on theory and applications
- Embedded feature-selection support vector machine for driving pattern recognition
- Feature selection for linear SVM with provable guarantees
- Imbalanced data classification using second-order cone programming support vector machines
- Quadratic programming feature selection
- Computing the signed distance between overlapping ellipsoids
- Robust formulations for clustering-based large-scale classification
- Regularization via mass transportation
- Feature Selection for Ridge Regression with Provable Guarantees
- Distributionally robust optimization
- Alternative second-order cone programming formulations for support vector classification
- Double regularization methods for robust feature selection and SVM classification via DC programming
- Using financial risk measures for analyzing generalization performance of machine learning models
This page was built for publication: Second order cone programming formulations for feature selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093230)
