Unsupervised elimination of redundant features using genetic programming

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

Abstract

While most feature selection algorithms focus on finding relevant features, few take the redundancy issue into account. We propose a nonlinear redundancy measure which uses genetic programming to find the redundancy quotient of a feature with respect to a subset of features. The proposed measure is unsupervised and works with unlabeled data. We introduce a forward selection algorithm which can be used along with the proposed measure to perform feature selection over the output of a feature ranking algorithm. The effectiveness of the proposed method is assessed by applying it to the output of the Chi-square (Χ2) feature ranker on a classification task. The results show significant improvements in the performance of decision tree and SVM classifiers. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Neshatian, K., & Zhang, M. (2009). Unsupervised elimination of redundant features using genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5866 LNAI, pp. 432–442). https://doi.org/10.1007/978-3-642-10439-8_44

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