Least Squares Support Vector Machine Classifiers

Clicks: 283
ID: 111180
1970
Free PDF
Article Quality & Performance Metrics
Overall Quality Improving Quality
0.0 /100
Combines engagement data with AI-assessed academic quality
AI Quality Assessment
Not analyzed
Abstract
In this letter we discuss a least squares version for support vector machine (SVM) classifiers. Due to equality type constraints in the formulation, the solution follows from solving a set of linear equations, instead of quadratic programming for classical SVM's. The approach is illustrated on a two-spiral benchmark classification problem.
Reference Key
suykens1970neuralleast Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors J.A.K. Suykens;J. Vandewalle;J.A.K. Suykens;J. Vandewalle;
Journal neural processing letters
Year 1970
DOI
doi:10.1023/A:1018628609742
URL
https://dx.doi.org/10.1023/A:1018628609742
Keywords
artificial intelligence complex systems computational intelligence

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.