The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Accurate On-line Support Vector Regression
Abstract
Batch implementations of support vector regression (SVR) are inefficient when used in an on-line setting because they must be retrained from scratch every time the training set is modified. Following an incremental support vector classification algorithm introduced by Cauwenberghs and Poggio (2001), we have developed an accurate on-line support vector regression (AOSVR) that efficiently updates a trained SVR function whenever a sample is added to or removed from the training set. The updated SVR function is identical to that produced by a batch algorithm. Applications of AOSVR in both on-line and cross-validation scenarios are presented.Inbothscenarios, numerical experiments indicate that AOSVR is faster than batch SVR algorithms with both cold and warm start.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
LIBSVM: A library for support vector machines
Chang, C.-C., & Lin, C.-J. (2011) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/1961189.1961199 · Cited by 40,918
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
A tutorial on support vector regression
Smola, A. J., & Schölkopf, B. (2004) · Statistics and Computing · doi:10.1023/b:stco.0000035301.49549.88 · Cited by 13,387
Oscillation and Chaos in Physiological Control Systems
Mackey, M. C., & Glass, L. (1977) · Science · doi:10.1126/science.267326 · Cited by 4,135
Incremental and Decremental Support Vector Machine Learning
Cauwenberghs, G., & Poggio, T. (2000) · neural information processing systems · Cited by 1,377
Application of support vector machines in financial time series forecasting
Tay, F. E. H., & Cao, L. (2001) · Omega · doi:10.1016/s0305-0483(01)00026-3 · Cited by 1,268
Out-of-sample tests of forecasting accuracy: an analysis and review
Tashman, L. J. (2000) · International Journal of Forecasting · doi:10.1016/s0169-2070(00)00065-0 · Cited by 1,021
Kivinen, J., Smola, A. J., & Williamson, R. C. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.830991 · Cited by 1,004
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
Bounds on Error Expectation for Support Vector Machines
Vapnik, V., & Chapelle, O. (2000) · Neural Computation · doi:10.1162/089976600300015042 · Cited by 624
Incremental learning with support vector machines
Ruping, S. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989589 · Cited by 524
LOQO:an interior point code for quadratic programming
Vanderbei, R. J. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805759 · Cited by 471
Relativistic electron dynamics in the inner magnetosphere — a review
Friedel, R. H. W., Reeves, G. D., & Obara, T. (2002) · Journal of Atmospheric and Solar-Terrestrial Physics · doi:10.1016/s1364-6826(01)00088-8 · Cited by 453
Estimating the generalization performance of a SVM efficiently
Joachims, T. (1999) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-5102 · Cited by 327
Training v-Support Vector Regression: Theory and Algorithms
Chang, C.-C., & Lin, C.-J. (2002) · Neural Computation · doi:10.1162/089976602760128081 · Cited by 316
A New Approximate Maximal Margin Classification Algorithm
Gentile, C. (2000) · neural information processing systems · Cited by 260
The Relaxed Online Maximum Margin Algorithm
Li, Y., & Long, P. M. (2002) · Machine Learning · doi:10.1023/a:1012435301888 · Cited by 225
Incremental Support Vector Machine Learning: A Local Approach
Ralaivola, L., & d’Alché–Buc, F. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44668-0_46 · Cited by 120
Warm start of the primal-dual method applied in the cutting-plane scheme
Gondzio, J. (1998) · Mathematical Programming · doi:10.1007/bf02680554 · Cited by 91
Oscillation and chaos in physiological control systems
Glass, L. (2001) · Nature · Cited by 79
Reoptimization With the Primal-Dual Interior Point Method
Gondzio, J., & Grothey, A. (2002) · SIAM Journal on Optimization · doi:10.1137/s1052623401393141 · Cited by 61
Learning Additive Models Online with Fast Evaluating Kernels
Herbster, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44581-1_29 · Cited by 54
Graepel, T., Herbrich, R., & Williamson, R. C. (2000) · Cited by 45
Cited by
Online-SVR for short-term traffic flow prediction under typical and atypical traffic conditions
Castro-Neto, M., Jeong, Y.-S., Jeong, M.-K., & Han, L. D. (2009) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.07.069 · Cited by 842
(2024) · Multivariate Biomarker Discovery · doi:10.1017/9781009006767.012 · Cited by 809
Traditional and recent approaches in background modeling for foreground detection: An overview
Bouwmans, T. (2014) · Computer Science Review · doi:10.1016/j.cosrev.2014.04.001 · Cited by 676
Model learning for robot control: A survey
Nguyen-Tuong, D., & Peters, J. (2011) · Cognitive Processing · doi:10.1007/s10339-011-0404-1 · Cited by 503
Incremental learning for ν-Support Vector Regression
Gu, B., Sheng, V. S., Wang, Z., Ho, D., Osman, S., & Li, S. (2015) · Neural Networks · doi:10.1016/j.neunet.2015.03.013 · Cited by 424
Metadata
- Authors
- Ma, J., Theiler, J., & Perkins, S.
- Venue
- Neural Computation
- Publisher
- MIT Press - Journals
- Published
- 2003-11-01
- Volume
- 15
- Issue
- 11
- Pages
- 2683-2703
- ISSN
- 0899-7667 (ISSN-L)
- 1530-888X
- OpenAlex
- W2098263691
- Cited by
- 408
- References
- 24
- FWCI
- 9.89
- 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.