A polynomial smooth support vector machine for classification

30Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new polynomial smooth method for solving the support vector machine (SVM) is presented in this paper. It is called the polynomial smooth support vector machine (PSSVM). BFGS method and Newton-Armijo method are applied to solve the PSSVM. Numerical experiments confirm that PSSVM is more effective than SVM. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Yuan, Y. B., & Huang, T. Z. (2005). A polynomial smooth support vector machine for classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3584 LNAI, pp. 157–164). Springer Verlag. https://doi.org/10.1007/11527503_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free