Affiliations: [a] School of Computer and Software, Nanjing University of Information Science and Technology, Nanjing, Jiangsu, China | [b] Engineering Research Center of Digital Forensics, Ministry of Education, Nanjing University of Information Science and Technology, Nanjing, Jiangsu, China | [c] COL Laboratory, School of Computer Science, University of Nottingham, Nottingham, UK
Correspondence:
[*]
Corresponding author: Ferrante Neri, School of Computer Science, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK. E-mail: ferrante.neri@nottingham.ac.uk.
Note: [1] Y. Xue and H. Zhu equally contributed to this work and should be considered co-first authors.
Abstract: In classification tasks, feature selection (FS) can reduce the data dimensionality and may also improve classification accuracy, both of which are commonly treated as the two objectives in FS problems. Many meta-heuristic algorithms have been applied to solve the FS problems and they perform satisfactorily when the problem is relatively simple. However, once the dimensionality of the datasets grows, their performance drops dramatically. This paper proposes a self-adaptive multi-objective genetic algorithm (SaMOGA) for FS, which is designed to maintain a high performance even when the dimensionality of the datasets grows. The main concept of SaMOGA lies in the dynamic selection of five different crossover operators in different evolution process by applying a self-adaptive mechanism. Meanwhile, a search stagnation detection mechanism is also proposed to prevent premature convergence. In the experiments, we compare SaMOGA with five multi-objective FS algorithms on sixteen datasets. According to the experimental results, SaMOGA yields a set of well converged and well distributed solutions on most data sets, indicating that SaMOGA can guarantee classification performance while removing many features, and the advantage over its counterparts is more obvious when the dimensionality of datasets grows.
