Classification in the multiple instance learning framework via spherical separation

DOI10.1007/s00500-019-04255-1zbMath1490.68182OpenAlexW2966273810MaRDI QIDQ2152886

E. Vocaturo, Manlio Gaudioso, Giovanna Miglionico, Giovanni Giallombardo

Publication date: 11 July 2022

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-019-04255-1

zbMATH Keywords

classificationbundle methodsDC functionsspherical separationmultiple-instance learning

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Spherical separation with infinitely far center ⋮ Partitional clustering via successive transportation problems ⋮ Sequential difference-of-convex programming ⋮ Essentials of numerical nonsmooth optimization ⋮ A maximum-margin multisphere approach for binary multiple instance learning ⋮ Essentials of numerical nonsmooth optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multi-instance classification through spherical separation and VNS
• Multiple instance classification: review, taxonomy and comparative study
• A DC optimization-based clustering technique for edge detection
• DC models for spherical separation
• A fixed-center spherical separation algorithm with kernel transformations for classification problems
• Multiple instance classification via successive linear programming
• Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• Margin maximization in spherical separation
• Proximal bundle methods for nonsmooth DC programming
• An inertial algorithm for DC programming
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• The Cutting-Plane Method for Solving Convex Programs
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
• Minimizing Piecewise-Concave Functions Over Polyhedra
• Optimizing sensor cover energy via DC programming