Fast training of support vector machines by extracting boundary data

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

Abstract

Support vector machines have gotten wide acceptance for their high generalization ability for real world applications. But the major drawback is slow training for classification problems with a large number of training data. To overcome this problem, in this paper, we discuss extracting boundary data from the training data and train the support vector machine using only these data. Namely, for each training datum we calculate the Mahalanobis distances and extract those data that are misclassified by the Mahalanobis distances or that have small relative differences of the Mahalanobis distances. We demonstrate the effectiveness of the method for the benchmark data sets.

Cite

CITATION STYLE

APA

Abe, S., & Inoue, T. (2001). Fast training of support vector machines by extracting boundary data. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2130, pp. 308–313). Springer Verlag. https://doi.org/10.1007/3-540-44668-0_44

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