Solving classification problems using infix form genetic programming

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

Abstract

A new evolutionary technique, called Infix Form Genetic Programming (IFGP) is proposed in this paper. The IFGP individuals are strings encoding complex mathematical expressions. The IFGP technique is used for solving several classification problems. All test problems are taken from PROBEN1 and contain real world data. IFGP is compared to Linear Genetic Programming (LGP) and Artificial Neural Networks (ANNs). Numerical experiments show that IFGP is able to solve the considered test problems with the same (and sometimes even better) classification error than that obtained by LGP and ANNs. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Oltean, M., & Groşan, C. (2003). Solving classification problems using infix form genetic programming. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2810, 242–253. https://doi.org/10.1007/978-3-540-45231-7_23

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