# Item

ITEM ACTIONSEXPORT

Released

Conference Paper

#### Maximal Margin Classification for Metric Spaces

##### External Resource

https://link.springer.com/content/pdf/10.1007%2F978-3-540-45167-9_7.pdf

(Publisher version)

##### Fulltext (restricted access)

There are currently no full texts shared for your IP range.

##### Fulltext (public)

There are no public fulltexts stored in PuRe

##### Supplementary Material (public)

There is no public supplementary material available

##### Citation

Hein, M., & Bousquet, O. (2004). Maximal Margin Classification for Metric Spaces.
In B. Schölkopf, & M. Warmuth (*Learning Theory and
Kernel Machines: 16th Annual Conference on Learning Theory and 7th Kernel Workshop, COLT/Kernel 2003, Washington, DC, USA,
August 24-27, 2003* (pp. 72-86). Berlin, Germany: Springer.

Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-D9D5-B

##### Abstract

In this article we construct a maximal margin classification algorithm for arbitrary metric spaces. At first we show that the Support Vector Machine (SVM) is a maximal margin algorithm for the class of metric spaces where the negative squared distance is conditionally positive definite (CPD). This means that the metric space can be isometrically embedded into a Hilbert space, where one performs linear maximal margin separation. We will show that the solution only depends on the metric, but not on the kernel. Following the framework we develop for the SVM, we construct an algorithm for maximal margin classification in arbitrary metric spaces. The main difference compared with SVM is that we no longer embed isometrically into a Hilbert space, but a Banach space. We further give an estimate of the capacity of the function class involved in this algorithm via Rademacher averages. We recover an algorithm of Graepel et al. [6].