Pages that link to "Item:Q2342142"
From MaRDI portal
The following pages link to Support vector machine polyhedral separability in semisupervised learning (Q2342142):
Displaying 17 items.
- Conic relaxations for semi-supervised support vector machines (Q289094) (← links)
- Approximate functions in a problem of sets separation (Q346819) (← links)
- A proximal quadratic surface support vector machine for semi-supervised binary classification (Q1626225) (← links)
- DC programming and DCA: thirty years of developments (Q1749443) (← links)
- A new conic approach to semisupervised support vector machines (Q1793456) (← links)
- A novel kernel-free nonlinear SVM for semi-supervised classification in disease diagnosis (Q2060068) (← links)
- Polyhedral separation via difference of convex (DC) programming (Q2100399) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- Semisupervised spherical separation (Q2285335) (← links)
- Nonlinear optimization and support vector machines (Q5915690) (← links)
- Nonlinear optimization and support vector machines (Q5918754) (← links)
- Maximum-margin polyhedral separation for binary multiple instance learning (Q6491336) (← links)
- A classification method based on a cloud of spheres (Q6491344) (← links)
- Stochastic subgradient algorithm for nonsmooth nonconvex optimization (Q6578251) (← links)
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem (Q6586914) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)
- New interior-point approach for one- and two-class linear support vector machines using multiple variable splitting (Q6596335) (← links)