Pages that link to "Item:Q2414473"
From MaRDI portal
The following pages link to Mixed integer linear programming for feature selection in support vector machine (Q2414473):
Displaying 12 items.
- Feature selection for support vector machines using generalized Benders decomposition (Q319318) (← links)
- Feature selection for support vector machines via mixed integer linear programming (Q506302) (← links)
- A novel embedded min-max approach for feature selection in nonlinear support vector machine classification (Q2030496) (← links)
- Optimal arrangements of hyperplanes for SVM-based multiclass classification (Q2183661) (← links)
- Tightening big Ms in integer programming formulations for support vector machines with ramp loss (Q2184093) (← links)
- A kernel search heuristic for a fair facility location problem (Q2668732) (← links)
- A mixed integer linear programming support vector machine for cost-effective group feature selection: branch-cut-and-price approach (Q2670542) (← links)
- Margin optimal classification trees (Q6065640) (← links)
- A kernel search heuristic for the multivehicle inventory routing problem (Q6092539) (← links)
- A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model (Q6106565) (← links)
- Comparing two SVM models through different metrics based on the confusion matrix (Q6109345) (← links)
- Improved heuristics for solving large-scale scanning transmission electron microscopy image segmentation using the ordered median problem (Q6551124) (← links)