Fast Support Vector Machine Classification for Large Data Sets

8Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Normal support vector machine (SVM) algorithms are not suitable for classification of large data sets because of high training complexity. This paper introduces a novel two-stage SVM classification approach for large data sets. Fast clustering techniques are introduced to select the training data from the original data set for the first stage SVM, and a de-clustering technique is then proposed to recover the training data for the second stage SVM. The proposed two-stage SVM classifier has distinctive advantages on dealing with huge data sets such as those in bioinformatics. Finally, we apply the proposed method on several benchmark problems. Experimental results demonstrate that our approach has good classification accuracy while the training is significantly faster than other SVM classifiers. © 2014 Copyright: the authors.

Cite

CITATION STYLE

APA

Li, X., & Yu, W. (2014). Fast Support Vector Machine Classification for Large Data Sets. International Journal of Computational Intelligence Systems, 7(2), 197–212. https://doi.org/10.1080/18756891.2013.868148

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