An Algorithm for Separating Patterns by Ellipsoids

DOI10.1147/rd.266.0759zbMath0504.68058OpenAlexW2069779689MaRDI QIDQ4741726

Earl R. Barnes

Publication date: 1982

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1147/rd.266.0759

zbMATH Keywords

ellipsoid of least volume containing a set of points in a finite- dimensional Euclidean spacepatterns in a feature space

Mathematics Subject Classification ID

Convex programming (90C25) Pattern recognition, speech recognition (68T10)

Related Items

Clustering via minimum volume ellipsoids ⋮ Optimal Data Fitting: A Moment Approach ⋮ Binary classification via spherical separator by DC programming and DCA ⋮ Scale-invariant clustering with minimum volume ellipsoids ⋮ Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities ⋮ Conditional minimum volume ellipsoid with application to multiclass discrimination ⋮ Applications of semidefinite programming ⋮ On the complexity of approximating the maximal inscribed ellipsoid for a polytope