An Algorithm for Separating Patterns by Ellipsoids

DOI10.1147/RD.266.0759MaRDI QIDQ4741726zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(8)

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

This page was built for publication: An Algorithm for Separating Patterns by Ellipsoids

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