Email this article Description of the design space by extremal ellipsoids in data representation problems
- Authors: Bedrintsev A.A.1, Chepyzhov V.V.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 61, No 6 (2016)
- Pages: 688-694
- Section: Mathematical Models and Computational Methods
- URL: https://journals.rcsi.science/1064-2269/article/view/197049
- DOI: https://doi.org/10.1134/S1064226916060048
- ID: 197049
Cite item
Open Access
Access granted
Subscription Access
Abstract
Problems of description of data sets by constructing the optimum ellipsoid are considered. The optimization problems are formulated as convex programming problems using linear matrix inequalities. The proposed methods are compared with similar methods designed earlier in accordance with two criteria: the volume of the ellipsoid and the number of points in the learning sample, which lie outside the ellipsoid.
About the authors
A. A. Bedrintsev
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: alekseybed@phystech.edu
Russian Federation, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
V. V. Chepyzhov
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: chep@iitp.ru
Russian Federation, Bol’shoi Karetnyi per. 19, str. 1, Moscow, 127051
