Cited by 59,421Machine Learning and AlgorithmsNeural Networks and ApplicationsMachine Learning and ELM

Support-vector networks

Open access
Cortes, Corinna, Vapnik, Vladimir·1995·Machine Learning

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.1007/bf00994018

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • QSVM is effective for large data, does not overfit, gives high accuracy with big feature maps, and allows use of the kernel trick.

    “Among the above listed methods, QSVM is an effective computing model in case of working with a large amount of data – it does not tend to overfit, provides high accuracy when working with a big feature map, and allows use of the kernel trick [39, 40].”

    From Security intrusion detection using quantum machine learning techniques (2022) · cites this paper as [39]

    The paper studies classical support-vector networks, not QSVM. Section 4 describes kernel-based feature-space calculations, and Sections 6.2–6.2.2 report strong accuracy on digit datasets, including one with 60,000 training patterns; Section 6.2.1 says increasing feature-space dimensionality showed no overfitting problems in those experiments. These findings do not establish that QSVM has the stated properties or that it generally does not overfit. Page numbers are unavailable in our copy. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • SVM is becoming increasingly popular for damage identification because of its superior ability to solve nonlinear, high-dimensional and small sample problems.

    “SVM is becoming increasingly popular these years for damage identification because of its superior ability to solve nonlinear, high-dimensional and small sample problems [173].”

    From Review on the new development of vibration-based damage identification for civil engineering structures: 2010–2019 (2021) · cites this paper as [173]

    The Abstract and Introduction describe nonlinear mapping into a high-dimensional feature space, and §6.2.1 reports good performance without apparent overfitting as feature-space dimensionality increases. The paper does not address damage identification or its growing popularity, and its digit-recognition experiments do not establish a superior ability to handle small samples. (LLM, conf=0.88)

    Experimental — accuracy not yet measured
  • The generalization error of the SVM is independent of the number of dimensions.

    “This makes the generalization error of the SVM independent of the number of dimensions.”
  • Traditional methods may require complex feature matching algorithms such as SIFT, SURF, or additional classifiers such as SVM, whereas the MobileNetV2 network model directly utilizes features extracted by the deep learning model to perform comparison, simplifying the process.

    “Traditional methods may require complex feature matching algorithms (e.g., SIFT, SURF) or additional classifiers (e.g., SVM), whereas the MobileNetV2 network model directly utilizes features extracted by the deep learning model to perform comparison, which simplifies the process [27,28].”

Self-check

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

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

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [10]10. Parker, D.B. (1985). Learning logic. Technical Report TR-47, Center for Computational Research in Economics and Management Science, Massachusetts Institute of Technology, Cambridge, MA.
  2. [14]14. Vapnik, V.N. (1982). Estimation ofDependences Based on Empirical Data, Addendum 1, New York: Springer- Verlag. Received May 15, 1993 Accepted February 20, 1995 Final Manuscript March 8, 1995

Cited by

Sorted by citations

Authors
Cortes, C., & Vapnik, V.
Affiliations
AT&T (United States) (US)
Venue
Machine Learning
Published
1995-09
Volume
20
Issue
3
Pages
273-297
ISSN
  • 0885-6125 (ISSN-L)
  • 1573-0565
OpenAlex
W4239510810
Cited by
59,421
References
14
Citations by year
2026: 4864 · 2025: 5184 · 2024: 4570 · 2023: 4472 · 2022: 4105 · 2021: 4479 · 2020: 4258 · 2019: 3920 · 2018: 3567 · 2017: 2895 · 2016: 2583 · 2015: 2464 · 2014: 2282 · 2013: 1923 · 2012: 1459
FWCI
33.84
Type
journal article
Language
en
Open access
Locations
Machine Learning (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and ELM
Keywords
binary classification, high-dimensional feature space, model generalization, optical character recognition

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