Online support vector machine based on minimum Euclidean distance

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

Abstract

The present study includes development of an online support vector machine (SVM) based on minimum euclidean distance (MED).We have proposed a MED support vector algorithm where SVM model is initialized with small amount of training data and test data is merged to SVM model for incorrect predictions only. This method provides a simpler and more computationally efficient implementation as it assign previously computed support vector coefficients. To merge test data in SVM model, we find the euclidean distance between test data and support vector of target class and the coefficients of MED of support vector of training class are assigned to test data. The proposed technique has been implemented on benchmark data set mnist where SVM model initialized with 20K images and tested for 40K data images. The proposed technique of online SVM results in overall error rate as 1.69% and without using online SVM results in error rate as 7.70%. The overall performance of the developed system is stable in nature and produce smaller error rate.

Cite

CITATION STYLE

APA

Dahiya, K., Kumar Chauhan, V., & Sharma, A. (2017). Online support vector machine based on minimum Euclidean distance. In Advances in Intelligent Systems and Computing (Vol. 459 AISC, pp. 89–99). Springer Verlag. https://doi.org/10.1007/978-981-10-2104-6_9

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