Maximum-margin polyhedral separation for binary multiple instance learning

DOI10.1016/J.EJCO.2023.100070MaRDI QIDQ6491336zbMATH OpenFDO

Authors Annabella Astorino, Matteo Avolio, A. Fuduli

Publication date 24 April 2024

Published in EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJCO.2023.100070

zbMATH Keywords

support vector machine (SVM)multiple instance learningpolyhedral separationdifference of convex (DC) functions

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• A maximum-margin multisphere approach for binary multiple instance learning
• Multiple instance learning via margin maximization
• Classification in the multiple instance learning framework via spherical separation
• Multi-instance learning with any hypothesis class
• Multiple instance classification via quadratic programming

Cites work

• scientific article; zbMATH DE number 823069 (Why is no real title available?)
• A maximum-margin multisphere approach for binary multiple instance learning
• Accurately learning from few examples with a polyhedral classifier
• Classification in the multiple instance learning framework via spherical separation
• Convergence of a block coordinate descent method for nondifferentiable minimization
• Max–min separability
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• Multi-instance classification through spherical separation and VNS
• Multiple instance classification via successive linear programming
• Multiple instance classification: review, taxonomy and comparative study
• Multiple instance learning. Foundations and algorithms
• Polyhedral separability through successive LP
• Polyhedral separation via difference of convex (DC) programming
• Separation via polyhedral conic functions
• Solving the multiple instance problem with axis-parallel rectangles.
• Support vector machine polyhedral separability in semisupervised learning
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Variable neighbourhood search: methods and applications

Cited in

(2)

• Hyperbolic secant representation of the logistic function: application to probabilistic multiple instance learning for CT intracranial hemorrhage detection
• Modern optimization approaches to classification -- special issue editorial

This page was built for publication: Maximum-margin polyhedral separation for binary multiple instance learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6491336)