Using genetic programming for context-sensitive feature scoring in classification problems

Feature scoring is an avenue to feature selection that provides a measure of usefulness for the individual features of a classification task. Features are ranked based on their scores and selection is performed by choosing a small group of high-ranked features. Most existing feature scoring/ranking methods focus on the relevance of a single feature to the class labels regardless of the role of other features (context-insensitive). The paper proposes a genetic programming (GP)-based method to see how a set of features can contribute towards discriminating different classes. The features receive score in the context of other features participating in a GP program. 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 feature ranking 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 proposed scoring-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 are very likely to improve the classification performance.

[1]  A. Asuncion,et al.  UCI Machine Learning Repository, University of California, Irvine, School of Information and Computer Sciences , 2007 .

[2]  Jesús S. Aguilar-Ruiz,et al.  Fast Feature Ranking Algorithm , 2003, KES.

[3]  Byung Ro Moon,et al.  Hybrid Genetic Algorithms for Feature Selection , 2004, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Riccardo Poli,et al.  A Field Guide to Genetic Programming , 2008 .

[5]  Ernesto Costa,et al.  Dynamic Limits for Bloat Control: Variations on Size and Depth , 2004, GECCO.

[6]  Wei-Pang Yang,et al.  Classifier design with feature selection and feature extraction using layered genetic programming , 2008, Expert Syst. Appl..

[7]  BullLarry,et al.  Genetic Programming with a Genetic Algorithm for Feature Construction and Selection , 2005 .

[8]  Abraham Kandel,et al.  Information-theoretic algorithm for feature selection , 2001, Pattern Recognit. Lett..

[9]  J. Biesiada,et al.  Feature ranking methods based on information entropy with Parzen windows , 2005 .

[10]  Lawrence Davis,et al.  Adapting Operator Probabilities in Genetic Algorithms , 1989, ICGA.

[11]  Chuanyi Ji,et al.  Combinations of Weak Classifiers , 1996, NIPS.

[12]  Jacques-André Landry,et al.  Discriminant feature selection by genetic programming : towards a domain independent multi-class object detection system , 2004 .

[13]  Isabelle Guyon,et al.  An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..

[14]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[15]  Julie Wilson,et al.  Novel feature selection method for genetic programming using metabolomic 1H NMR data , 2006 .

[16]  Huan Liu,et al.  Chi2: feature selection and discretization of numeric attributes , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.

[17]  Thy-Hou Lin,et al.  Supervised Feature Ranking Using a Genetic Algorithm Optimized Artificial Neural Network , 2006, J. Chem. Inf. Model..

[18]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[19]  Grant Dick,et al.  Implicitly Controlling Bloat in Genetic Programming , 2010, IEEE Transactions on Evolutionary Computation.

[20]  Ian Witten,et al.  Data Mining , 2000 .

[21]  Peter Nordin,et al.  Genetic programming - An Introduction: On the Automatic Evolution of Computer Programs and Its Applications , 1998 .

[22]  Georgios C. Anagnostopoulos,et al.  Knowledge-Based Intelligent Information and Engineering Systems , 2003, Lecture Notes in Computer Science.

[23]  Pat Langley,et al.  Estimating Continuous Distributions in Bayesian Classifiers , 1995, UAI.

[24]  S. Sathiya Keerthi,et al.  Improvements to Platt's SMO Algorithm for SVM Classifier Design , 2001, Neural Computation.

[25]  Terence Soule,et al.  Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming , 1998, Evolutionary Computation.

[26]  Riccardo Poli,et al.  Foundations of Genetic Programming , 1999, Springer Berlin Heidelberg.