Multi objective genetic programming for feature construction in classification problems

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

Abstract

This work introduces a new technique for features construction in classification problems by means of multi objective genetic programming (MOGP). The final goal is to improve the generalization ability of the final classifier. MOGP can help in finding solutions with a better generalization ability with respect to standard genetic programming as stated in [1]. The main issue is the choice of the criteria that must be optimized by MOGP. In this work the construction of new features is guided by two criteria: the first one is the entropy of the target classes as in [7] while the second is inspired by the concept of margin used in support vector machines. © Springer-Verlag Berlin Heidelberg 2011.

Cite

CITATION STYLE

APA

Castelli, M., Manzoni, L., & Vanneschi, L. (2011). Multi objective genetic programming for feature construction in classification problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6683 LNCS, pp. 503–506). https://doi.org/10.1007/978-3-642-25566-3_39

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