The semiproximal SVM approach for multiple instance learning: a kernel-based computational study
From MaRDI portal
Publication:6151533
DOI10.1007/s11590-023-02022-8OpenAlexW4380848872MaRDI QIDQ6151533
Publication date: 11 March 2024
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-023-02022-8
support vector machinemultiple instance learningkernel transformationssemiproximal support vector machine
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiple instance classification: review, taxonomy and comparative study
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- Multiple instance classification via successive linear programming
- Solving the multiple instance problem with axis-parallel rectangles.
- A maximum-margin multisphere approach for binary multiple instance learning
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Multiple Instance Learning
- A splitting bundle approach for non-smooth non-convex minimization
- Convergence of a block coordinate descent method for nondifferentiable minimization
This page was built for publication: The semiproximal SVM approach for multiple instance learning: a kernel-based computational study