Ellipsoidal separation for classification problems

DOI10.1080/10556780512331318254zbMath1072.90027OpenAlexW2024650813WikidataQ62473106 ScholiaQ62473106MaRDI QIDQ5317749

Annabella Astorino, Manlio Gaudioso

Publication date: 21 September 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780512331318254

zbMATH Keywords

classificationnonsmooth optimizationlocal searchnonlinear programmingseparation of sets

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25)

Related Items (12)

A fixed-center spherical separation algorithm with kernel transformations for classification problems ⋮ Supervised classification and mathematical optimization ⋮ Binary classification via spherical separator by DC programming and DCA ⋮ DC models for spherical separation ⋮ Margin maximization in spherical separation ⋮ Ellipsoidal classification via semidefinite programming ⋮ An approach to classification based on separation of sets by means of several ellipsoids ⋮ A DC optimization-based clustering technique for edge detection ⋮ Semisupervised spherical separation ⋮ Support vector machine polyhedral separability in semisupervised learning ⋮ Polyhedral separation via difference of convex (DC) programming ⋮ Edge detection by spherical separation

Cites Work

• Unnamed Item
• Unnamed Item
• Pattern separation by convex programming
• Semidefinite Programming
• Linear and Nonlinear Separation of Patterns by Linear Programming
• Multisurface method of pattern separation
• Polyhedral separability through successive LP

This page was built for publication: Ellipsoidal separation for classification problems