The semiproximal SVM approach for multiple instance learning: a kernel-based computational study
From MaRDI portal
Publication:6151533
Recommendations
- A theoretical and empirical analysis of support vector machine methods for multiple-instance classification
- Multiple instance learning via margin maximization
- A maximum-margin multisphere approach for binary multiple instance learning
- A multi-instance learning algorithm based on nonparallel classifier
- Multiple instance classification via successive linear programming
Cites work
- scientific article; zbMATH DE number 823069 (Why is no real title available?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A fixed-center spherical separation algorithm with kernel transformations for classification problems
- A maximum-margin multisphere approach for binary multiple instance learning
- A splitting bundle approach for non-smooth non-convex minimization
- An extension on ``Statistical comparisons of classifiers over multiple data sets for all pairwise comparisons
- Convergence of a block coordinate descent method for nondifferentiable minimization
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- Multiple instance classification via successive linear programming
- Multiple instance classification: review, taxonomy and comparative study
- Multiple instance learning. Foundations and algorithms
- Solving the multiple instance problem with axis-parallel rectangles.
- Statistical comparisons of classifiers over multiple data sets
This page was built for publication: The semiproximal SVM approach for multiple instance learning: a kernel-based computational study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151533)
