The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Recurrent least squares support vector machines
Abstract
The method of support vector machines (SVM's) has been developed for solving classification and static function approximation problems. In this paper we introduce SVM's within the context of recurrent neural networks. Instead of Vapnik's epsilon insensitive loss function, we consider a least squares version related to a cost function with equality constraints for a recurrent network. Essential features of SVM's remain, such as Mercer's condition and the fact that the output weights are a Lagrange multiplier weighted sum of the data points. The solution to recurrent least squares (LS-SVM's) is characterized by a set of nonlinear equations. Due to its high computational complexity, we focus on a limited case of assigning the squared error an infinitely large penalty factor with early stopping as a form of regularization. The effectiveness of the approach is demonstrated on trajectory learning of the double scroll attractor in Chua's circuit.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
The Nature of Statistical Learning Theory
Vapnik, V. N. (1995) · doi:10.1007/978-1-4757-2440-0 · Cited by 39,138
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Neural Networks: A Comprehensive Foundation
Haykin, S. (1998) · Cited by 30,070
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Least Squares Support Vector Machine Classifiers
Suykens, J. A. K., & Vandewalle, J. (1999) · Neural Processing Letters · doi:10.1023/a:1018628609742 · Cited by 9,362
Self-citationIdentification and control of dynamical systems using neural networks
Narendra, K. S., & Parthasarathy, K. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80202 · Cited by 8,014
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Cited by
Weighted least squares support vector machines: robustness and sparse approximation
Suykens, J. A. K., De Brabanter, J., Lukas, L., & Vandewalle, J. (2002) · Neurocomputing · doi:10.1016/s0925-2312(01)00644-0 · Cited by 1,265
Self-citationBenchmarking Least Squares Support Vector Machine Classifiers
van Gestel, T., Suykens, J. A. K., Baesens, B., Viaene, S., Vanthienen, J., Dedene, G., de Moor, B., & Vandewalle, J. (2004) · Machine Learning · doi:10.1023/b:mach.0000008082.80494.e0 · Cited by 745
Self-citationVan Gestel, T., Suykens, J. A. K., Baestaens, D.-E., Lambrechts, A., Lanckriet, G., Vandaele, B., De Moor, B., & Vandewalle, J. (2001) · IEEE Transactions on Neural Networks · doi:10.1109/72.935093 · Cited by 499
Self-citationGestel, T. V., Suykens, J. A. K., Lanckriet, G., Lambrechts, A., Moor, B. D., & Vandewalle, J. (2002) · Neural Computation · doi:10.1162/089976602753633411 · Cited by 291
Self-citationSupport Vector Echo-State Machine for Chaotic Time-Series Prediction
Shi, Z., & Han, M. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.885113 · Cited by 258
Metadata
- Authors
- Suykens, J. A. K., & Vandewalle, J.
- Venue
- IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
- Published
- 2000-07
- Volume
- 47
- Issue
- 7
- Pages
- 1109-1114
- ISSN
- 1057-7122 (ISSN-L)
- OpenAlex
- W2120879667
- Cited by
- 338
- References
- 31
- FWCI
- 5.00
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Recurrent least squares support vector machines. https://app.cochat.ai/papers/10.1109/81.855471
- The paper
- Suykens, J. A. K., & Vandewalle, J. (2000). Recurrent least squares support vector machines. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications. https://doi.org/10.1109/81.855471
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.