Ellipsoidal support vector data description

This paper presents a data domain description formed by the minimum volume covering ellipsoid around a dataset, called “ellipsoidal support vector data description (eSVDD).” The method is analogous to support vector data description (SVDD), but instead, with an ellipsoidal domain description allowing tighter space around the data. In eSVDD, a hyperellipsoid extends its ability to describe more complex data patterns by kernel methods. This is explicitly achieved by defining an “empirical feature map” to project the images of given samples to a higher-dimensional space. We compare the performance of the kernelized ellipsoid in one-class classification with SVDD using standard datasets.