Estimating the optimal margins of embeddings in Euclidean half spaces

15Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Concept classes can canonically be represented by matrices with entries 1 and −1. We use the singular value decomposition of this matrix to determine the optimal margins of embeddings of the concept classes of singletons and of half intervals in homogeneous Euclidean half spaces. For these concept classes the singular value decomposition can be used to construct optimal embeddings and also to prove the corresponding best possible upper bounds on the margin. We show that the optimal margin for embedding n singletons is n/3n-4 and that the optimal margin for half intervals over {1,..., n} is π/2ln n + Θ (1/(ln n)2). For the upper bounds on the margins we generalize a bound given in [6]. We also discuss the concept classes of monomials to point out limitations of our approach.

Cite

CITATION STYLE

APA

Forster, J., Schmitt, N., & Simon, H. U. (2001). Estimating the optimal margins of embeddings in Euclidean half spaces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2111, pp. 402–415). Springer Verlag. https://doi.org/10.1007/3-540-44581-1_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free