Improving support vector machine using a stochastic local search for classification in datamining

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

Abstract

In this paper, an improved support vector machine using a stochastic local search (SVM+SLS) is studied for the classification problem in Datamining. The proposed approach tries to find a subset of features that maximizes the classification accuracy rate of SVM. Experiments on some datasets are performed to show and compare the effectiveness of the proposed approach. The computational experiments show that the proposed SVM+SLS provides competitive results and finds high quality solutions. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Nekkaa, M., & Boughaci, D. (2012). Improving support vector machine using a stochastic local search for classification in datamining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7664 LNCS, pp. 168–175). https://doi.org/10.1007/978-3-642-34481-7_21

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