The DOI matches its Crossref record.
Feature space interpretation of SVMs with indefinite kernels
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.
Integrity signals
Registry
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.
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
- Lodhi, 2002, Text Classification Using String Kernels, J. Machine Learning Research, 2, 419
- Cortes, Rational Kernels, 15
- 10.1017/CBO9780511801389 · DOI · Paper page
- 10.7551/mitpress/4175.001.0001 · DOI · Paper page
- Chapelle, Model Selection for Support Vector Machines, 230
- 10.1007/978-1-4757-2440-0 · DOI · Paper page
- 10.1109/IWFHR.2002.1030883 · DOI
- 10.1023/A:1012454411458 · DOI · Paper page
- 10.1109/ICPR.2002.1048439 · DOI
- Moreno, A Kullback-Leibler Divergence Based Kernel for SVM Classification in Multimedia Applications, 16, 1385
- Shimodaira, Dynamic Time-Alignment Kernel in Support Vector Machine, 14, 921
- 10.1109/ICASSP.1999.759878 · doi:10.1109/icassp.1999.759878
- 10.1007/978-3-540-28649-3_27 · DOI
- Graepel, Classification on Pairwise Proximity Data, 11, 438
- Pekalska, 2001, A Generalized Kernel Approach to Dissimilarity Based Classification, J. Machine Learning Research, 2, 175
- Goldfarb, 1985, A New Approach to Pattern Recognition, Progress in Pattern Recognition 2, 241
- Bennett, Duality and Geometry in SVM Classifiers, 57
- Crisp, A Geometric Interpretation of nu-SVM Classifiers, 12, 223
- 10.1162/089976600300015565 · DOI
- 10.1162/089976601750399335 · DOI · Paper page
- 10.1007/BFb0000035 · DOI · Paper page
- 10.1049/cp:19991126 · DOI
- 10.1007/978-3-540-45167-9_7 · doi:10.1007/978-3-540-45167-9_7
Cited by
Arrieta, A. B., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., García, S., Gil-López, S., Molina, D., Benjamins, R., et al. (2019) · arXiv · doi:10.48550/arxiv.1910.10045 · Cited by 11,321
Barredo Arrieta, A., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., Garcia, S., Gil-Lopez, S., Molina, D., Benjamins, R., et al. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.12.012 · Cited by 10,423
“The work in [102] revolves around this issue with a geometrical interpretation of in-definite kernel SVMs, showing that these do not classify by hyper-plane margin optimization.”
Explainable artificial intelligence: a comprehensive review
Minh, D., Wang, H. X., Li, Y. F., & Nguyen, T. N. (2022) · Artificial Intelligence Review · doi:10.1007/s10462-021-10088-y · Cited by 983
Grassmann discriminant analysis: a unifying view on subspace-based learning
Hamm, J., & Lee, D. D. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390204 · Cited by 592
Hierarchical Aligned Cluster Analysis for Temporal Clustering of Human Motion
Zhou, F., De la Torre, F., & Hodgins, J. K. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.137 · Cited by 337
A review on distance based time series classification
Abanda, A., Mori, U., & Lozano, J. A. (2019) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-018-0596-4 · Cited by 296
Similarity-based Classification: Concepts and Algorithms
Chen, Y., Garcia, E. K., Gupta, M. R., Rahimi, A., & Cazzanti, L. (2009) · doi:10.5555/1577069.1577096 · Cited by 292
Survey on Explainable AI: Techniques, challenges and open issues
Abusitta, A., Li, M. Q., & Fung, B. C. M. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124710 · Cited by 98
Indefinite core vector machine
Schleif, F.-M., & Tino, P. (2017) · Pattern Recognition · doi:10.1016/j.patcog.2017.06.003 · Cited by 26
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
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.