An algorithm for separating patterns by ellipsoids

Authors:
E. R. Barnes
Affiliations:
IBM Research Division, Yorktown Heights, New York
Venue:
IBM Journal of Research and Development
Year:
1982

Citing 0
Cited 5

Scale-invariant clustering with minimum volume ellipsoids

Computers and Operations Research
Elliptic indexing of multidimensional databases

ADC '09 Proceedings of the Twentieth Australasian Conference on Australasian Database - Volume 92
An efficient DCA for spherical separation

ACIIDS'11 Proceedings of the Third international conference on Intelligent information and database systems - Volume Part II
A new formulation for classification by ellipsoids

TAINN'05 Proceedings of the 14th Turkish conference on Artificial Intelligence and Neural Networks
Binary classification via spherical separator by DC programming and DCA

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an algorithm for finding the ellipsoid of least volume containing a set of points in a finite-dimensional Euclidean space. Such ellipsoids have been proposed for separating patterns in a feature space.