Searching parameter values in support vector machines using DNA genetic algorithms

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

Abstract

A novel DNA encoding genetic algorithm, called SVM-DNAGA, is proposed to search for optimal values for the parameters in support vector machines. With this algorithm, the training process of support vector machines can converge quickly and the performance of the support vector machines can improve. The parameters in the support vector machines are encoded into chromosomes using DNA encoding. DNA genetic operations, including selection, transgenosis and frameshift mutation, are used in SVM-DNAGA. Four datasets are used in the computational experiments to verify the effectiveness of SVM-DNAGA. Compared with other commonly used classifiers, SVM-DNAGA obtains very good results.

Cite

CITATION STYLE

APA

Zang, W., & Sun, M. (2016). Searching parameter values in support vector machines using DNA genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9567, pp. 588–598). Springer Verlag. https://doi.org/10.1007/978-3-319-31854-7_53

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