Pages that link to "Item:Q1652409"

The following pages link to Lagrangian relaxation for SVM feature selection (Q1652409):

Displaying 18 items.

• A comparative study of the leading machine learning techniques and two new optimization algorithms (Q1991232) (← links)
• Optimization problems for machine learning: a survey (Q2029894) (← links)
• Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
• Tightening big Ms in integer programming formulations for support vector machines with ramp loss (Q2184093) (← links)
• Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
• Mixed integer linear programming for feature selection in support vector machine (Q2414473) (← links)
• Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains (Q2668766) (← links)
• Generalizations, formulations and subgradient based heuristic with dynamic programming procedure for target set selection problems (Q2669540) (← links)
• Robust optimal classification trees under noisy labels (Q2673362) (← links)
• On $\ell_p$-Support Vector Machines and Multidimensional Kernels (Q4969046) (← links)
• Nonlinear optimization and support vector machines (Q5915690) (← links)
• Nonlinear optimization and support vector machines (Q5918754) (← links)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
• Comparing two SVM models through different metrics based on the confusion matrix (Q6109345) (← links)
• Ellipsoidal classification via semidefinite programming (Q6161915) (← links)
• Dual formulation of the sparsity constrained optimization problem: application to classification (Q6585821) (← links)
• Difference of Convex programming in adversarial SVM (Q6593354) (← links)
• Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization (Q6619608) (← links)