A framework for optimization of genetic programming evolved classifier expressions using particle swarm optimization

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

Abstract

Genetic Programming has emerged as an efficient algorithm for classification. It offers several prominent features like transparency, flexibility and efficient data modeling ability. However, GP requires long training times and suffers from increase in average population size during evolution. The aim of this paper is to introduce a framework to increase the accuracy of classifiers by performing a PSO based optimization approach. The proposed hybrid framework has been found efficient in increasing the accuracy of classifiers (expressed in the form of binary expression trees) in comparatively lesser number of function evaluations. The technique has been tested using five datasets from the UCI ML repository and found efficient. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Jabeen, H., & Baig, A. R. (2010). A framework for optimization of genetic programming evolved classifier expressions using particle swarm optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6076 LNAI, pp. 56–63). https://doi.org/10.1007/978-3-642-13769-3_7

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