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

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

An improved training algorithm for support vector machines

Osuna, E., Freund, R., Girosi, F.·2002·Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop

Abstract

We investigate the problem of training a Support Vector Machine (SVM) [1, 2, 7] on a very large date base (e.g. 50,000 data points) in the case in which the number of support vectors is also very large (e.g. 40,000). Training a SVM is equivalent to solving a linearly constrained quadratic programming (QP) problem in a numberofvariables equal to the number of data points. This optimization problem is known to be challenging when the number of data points exceeds few thousands. In previous work, done byusaswell as by other researchers, the strategy used to solve the large scale QP problem takes advantage of the fact that the expected number of support vectors is small (< 3; 000). Therefore, the existing algorithms cannot deal with more than a few thousand support vectors. In this paper we present a decomposition algorithm that is guaranteed to solve the QP problem and that does not make assumptions on the expected number of support vectors. In order to present the feasibility of our approach we consider a foreign exchange rate time series data base with 110,000 data points that generates 100,000 support vectors. 1

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/nnsp.1997.622408

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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

Show all 2 references

Cited by

See all 1,061

Metadata

Authors
Osuna, E., Freund, R., & Girosi, F.
Venue
Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop
Publisher
IEEE
Published
2002-11-22
Pages
276-285
OpenAlex
W1761010383
Cited by
1,061
References
2
FWCI
54.10
Type
conference paper
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: An improved training algorithm for support vector machines. https://app.cochat.ai/papers/10.1109/nnsp.1997.622408
The paper
Osuna, E., Freund, R., & Girosi, F. (2002). An improved training algorithm for support vector machines. Neural Networks for Signal Processing VII. Proceedings of the 1997 IEEE Signal Processing Society Workshop. https://doi.org/10.1109/nnsp.1997.622408

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.