Multiobjective genetic programming feature extraction with optimized dimensionality

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

Abstract

We present a multi-dimensional mapping strategy using multiobjective genetic programming (MOGP) to search for the (near-)optimal feature extraction pre-processing stages for pattern classification as well as optimizing the dimensionality of the decision space. We search for the set of mappings with optimal dimensionality to project the input space into a decision space with maximized class separability. The steady-state Pareto converging genetic programming (PCGP) has been used to implement this multi-dimensional MOGP. We examine the proposed method using eight benchmark datasets from the UCI database and the Statlog project to make quantitative comparison with conventional classifiers. We conclude that MMOGP outperforms the comparator classifiers due to its optimized feature extraction process. © 2007 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zhang, Y., & Rockett, P. I. (2007). Multiobjective genetic programming feature extraction with optimized dimensionality. Advances in Soft Computing, 39, 159–168. https://doi.org/10.1007/978-3-540-70706-6_15

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