Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 233

The DOI matches its Crossref record.

Feature space interpretation of SVMs with indefinite kernels

Haasdonk, B.·2005·IEEE Transactions on Pattern Analysis and Machine Intelligence

Abstract

Kernel methods are becoming increasingly popular for various kinds of machine learning tasks, the most famous being the support vector machine (SVM) for classification. The SVM is well understood when using conditionally positive definite (cpd) kernel functions. However, in practice, non-cpd kernels arise and demand application in SVMs. The procedure of "plugging" these indefinite kernels in SVMs often yields good empirical classification results. However, they are hard to interpret due to missing geometrical and theoretical understanding. In this paper, we provide a step toward the comprehension of SVM classifiers in these situations. We give a geometric interpretation of SVMs with indefinite kernel functions. We show that such SVMs are optimal hyperplane classifiers not by margin maximization, but by minimization of distances between convex hulls in pseudo-Euclidean spaces. By this, we obtain a sound framework and motivation for indefinite SVMs. This interpretation is the basis for further theoretical analysis, e.g., investigating uniqueness, and for the derivation of practical guidelines like characterizing the suitability of indefinite SVMs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpami.2005.78

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

No references could be resolved yet.

Research works printed but not linked: 23

  1. Lodhi, 2002, Text Classification Using String Kernels, J. Machine Learning Research, 2, 419
  2. Cortes, Rational Kernels, 15
  3. 10.1017/CBO9780511801389 · DOI · Paper page
  4. 10.7551/mitpress/4175.001.0001 · DOI · Paper page
  5. Chapelle, Model Selection for Support Vector Machines, 230
  6. 10.1007/978-1-4757-2440-0 · DOI · Paper page
  7. 10.1109/IWFHR.2002.1030883 · DOI
  8. 10.1023/A:1012454411458 · DOI · Paper page
  9. 10.1109/ICPR.2002.1048439 · DOI
  10. Moreno, A Kullback-Leibler Divergence Based Kernel for SVM Classification in Multimedia Applications, 16, 1385
  11. Shimodaira, Dynamic Time-Alignment Kernel in Support Vector Machine, 14, 921
  12. 10.1109/ICASSP.1999.759878 · doi:10.1109/icassp.1999.759878
  13. 10.1007/978-3-540-28649-3_27 · DOI
  14. Graepel, Classification on Pairwise Proximity Data, 11, 438
  15. Pekalska, 2001, A Generalized Kernel Approach to Dissimilarity Based Classification, J. Machine Learning Research, 2, 175
  16. Goldfarb, 1985, A New Approach to Pattern Recognition, Progress in Pattern Recognition 2, 241
  17. Bennett, Duality and Geometry in SVM Classifiers, 57
  18. Crisp, A Geometric Interpretation of nu-SVM Classifiers, 12, 223
  19. 10.1162/089976600300015565 · DOI
  20. 10.1162/089976601750399335 · DOI · Paper page
  21. 10.1007/BFb0000035 · DOI · Paper page
  22. 10.1049/cp:19991126 · DOI
  23. 10.1007/978-3-540-45167-9_7 · doi:10.1007/978-3-540-45167-9_7

Cited by

See all 233

Metadata

Authors
Haasdonk, B.
Venue
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2005-04
Volume
27
Issue
4
Pages
482-492
ISSN
0162-8828 (ISSN-L)
OpenAlex
W2129971280
Cited by
233
References
0
FWCI
16.49
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Feature space interpretation of SVMs with indefinite kernels. https://app.cochat.ai/papers/10.1109/tpami.2005.78
The paper
Haasdonk, B. (2005). Feature space interpretation of SVMs with indefinite kernels. IEEE Transactions on Pattern Analysis and Machine Intelligence. https://doi.org/10.1109/tpami.2005.78

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.