The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
10.1162/15324430152733142
Open accessAbstract
Support Vector Machines (SVMs) for regression problems are trained by solving a quadratic optimization problem which needs on the order of l 2 memory and time resources to solve, where l is the number of training examples.In this paper, we propose a decomposition algorithm, SVMTorch 1 , which is similar to SVM-Light proposed by Joachims (1999) for classi cation problems, but adapted to regression problems.With this algorithm, one can now eciently solve large-scale regression problems (more than 20000 examples).Comparisons with Nodelib, another publicly available SVM algorithm for large-scale regression problems from Flake and Lawrence (2000) yielded signi cant time improvements.Finally, based on a recent paper from Lin (2000), we show that a convergence proof exists for our algorithm.
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
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Fast Training of Support Vector Machines Using Sequential Minimal Optimization
Platt, J. C. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0016 · Cited by 5,437
Making Large-Scale Support Vector Machine Learning Practical
Joachims, T. (1998) · Advances in Kernel Methods · doi:10.7551/mitpress/1130.003.0015 · Cited by 1,613
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 · doi:10.1109/nnsp.1997.622408 · Cited by 1,061
Predicting time series with support vector machines
Müller, K. R., Smola, A. J., Rätsch, G., Schölkopf, B., Kohlmorgen, J., & Vapnik, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0020283 · Cited by 981
Improvements to the SMO algorithm for SVM regression
Shevade, S. K., Keerthi, S. S., Bhattacharyya, C., & Murthy, K. R. K. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.870050 · Cited by 858
Cited by
Gaussian Processes for Machine Learning
Rasmussen, C. E., & Williams, C. K. I. (2005) · doi:10.7551/mitpress/3206.001.0001 · Cited by 11,705
“Our experiments were conducted using the SVMTorch software [Collobert and Bengio, 2001].”
Dlib-ml: A Machine Learning Toolkit
King, D. E. (2009) · doi:10.5555/1577069.1755843 · Cited by 2,777
Training linear SVMs in linear time
Joachims, T. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150429 · Cited by 1,920
Time Series Prediction Using Support Vector Machines: A Survey
Sapankevych, N., & Sankar, R. (2009) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2009.932254 · Cited by 1,129
HAMMER: hierarchical attribute matching mechanism for elastic registration
Shen, D., & Davatzikos, C. (2002) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.2002.803111 · Cited by 1,083
Metadata
- Venue
- CrossRef Listing of Deleted DOIs
- Publisher
- Unmaintained records
- Published
- 2000
- Volume
- 1
- ISSN
- 0003-6951 (ISSN-L)
- OpenAlex
- W1486089539
- Cited by
- 385
- References
- 6
- FWCI
- 22.07
- Type
- journal article
- Language
- en
- Open access
- green
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: 10.1162/15324430152733142. https://app.cochat.ai/papers/10.1162/15324430152733142
- The paper
- 10.1162/15324430152733142. (2000). CrossRef Listing of Deleted DOIs. https://doi.org/10.1162/15324430152733142
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.