Online model-based twin parametric-margin support vector machine

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

Abstract

In this paper, an online model-based TPMSVM (OTPMSVM) is proposed in a reproducing Kernel Hilbert space (RKHS). By exploiting the techniques of the Lagrange dual problem like SVM, the solution of this OTPMSVM can be obtained iteratively and the solution of each iteration can be much efficiently determined. It is illustrated that, based on the experimental results, the accuracy of OTPMSVM is comparable with SVM and other state-of-the-art algorithms. On the other hand, the computational cost of this OTPMSVM algorithm is comparable with or slightly lower than existing online methods, but much lower than that of SVM-based algorithms. © 2014 Springer International Publishing Switzerland.

Cite

CITATION STYLE

APA

Peng, X., Kong, L., Chen, D., & Xu, D. (2014). Online model-based twin parametric-margin support vector machine. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8588 LNCS, pp. 741–752). Springer Verlag. https://doi.org/10.1007/978-3-319-09333-8_81

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