Genetic programming for feature ranking in classification problems

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

Abstract

Feature ranking (FR) provides a measure of usefulness for the attributes of a classification task. Most existing FR methods focus on the relevance of a single feature to the class labels. Here, we use GP to see how a set of features can contribute towards discriminating different classes and then we score the participating features accordingly. The scoring mechanism is based on the frequency of appearance of each feature in a collection of GP programs and the fitness of those programs. Our results show that the proposed FR method can detect important features of a problem. A variety of different classifiers restricted to just a few of these high-ranked features work well. The ranking mechanism can also shrink the search space of size O(2 n ) of subsets of features to a search space of size O(n) in which there are points that may improve the classification performance. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Neshatian, K., Zhang, M., & Andreae, P. (2008). Genetic programming for feature ranking in classification problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5361 LNAI, pp. 544–554). https://doi.org/10.1007/978-3-540-89694-4_55

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