Variable-Length Representation for EC-Based Feature Selection in High-Dimensional Data

• Published in: Applications of Evolutionary Computation Vol. 11454; pp. 325 - 340
• Main Authors: Cilia, N. D., De Stefano, C., Fontanella, F., Scotto di Freca, A.
• Format: Book Chapter
• Language: English
• Published: Switzerland Springer International Publishing AG 2019; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Evolutionary algorithms; Feature selection; Variable length representation
• ISBN: 3030166910; 9783030166915
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-030-16692-2_22

Feature selection is a challenging problem, especially when hundreds or thousands of features are involved. Evolutionary Computation based techniques and in particular genetic algorithms, because of their ability to explore large and complex search spaces, have proven to be effective in solving such kind of problems. Though genetic algorithms binary strings provide a natural way to represent feature subsets, several different representation schemes have been proposed to improve the performance, with most of them needing to a priori set the number of features. In this paper, we propose a novel variable length representation, in which feature subsets are represented by lists of integers. We also devised a crossover operator to cope with the variable length representation. The proposed approach has been tested on several datasets and the results compared with those achieved by a standard genetic algorithm. Results of comparisons demonstrated the effectiveness of the proposed approach in improving the performance obtainable with a standard genetic algorithm when thousand of features are involved.