Least Squares Support Vector Machine Classifiers

Clicks: 355
ID: 111180
1970
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Star

Ranked #1 of 3 articles by views in neural processing letters

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
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.