Efficient support vector machine classification using prototype selection and generation

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Although Support Vector Machines (SVMs) are considered effective supervised learning methods, their training procedure is timeconsuming and has high memory requirements. Therefore, SVMs are inappropriate for large datasets. Many Data Reduction Techniques have been proposed in the context of dealing with the drawbacks of k-Nearest Neighbor classification. This paper adopts the concept of data reduction in order to cope with the high computational cost and memory requirements in the training process of SVMs. Experimental results illustrate that Data Reduction Techniques can effectively improve the performance of SVMs when applied as a preprocessing step on the training data.

Cite

CITATION STYLE

APA

Ougiaroglou, S., Diamantaras, K. I., & Evangelidis, G. (2016). Efficient support vector machine classification using prototype selection and generation. In IFIP Advances in Information and Communication Technology (Vol. 475, pp. 328–340). Springer New York LLC. https://doi.org/10.1007/978-3-319-44944-9_28

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