Feature selection based on meta-heuristics for biomedicine

• Published in: Optimization methods & software Vol. 29; no. 4; pp. 703 - 719
• Main Authors: Wang, Ling, Ni, Haoqi, Yang, Ruixin, Pappu, Vijay, Fenn, Michael B., Pardalos, Panos M.
• Format: Journal Article
• Language: English
• Published: Abingdon Taylor & Francis 04.07.2014; Taylor & Francis Ltd
• Subjects: Algorithms; Ant colony optimization; Biomedical research; biomedicine; Computer programs; Demand; feature selection; Genetic algorithms; Heuristic methods; meta-heuristic; Searching; Software
• ISSN: 1055-6788; 1029-4937
• DOI: 10.1080/10556788.2013.834900

Feature selection can efficiently improve the accuracy of classification and reduce the measurement, storage and computation demands, and thus it has been applied in biomedical research increasingly. Considering the non-deterministic polynomial-time hard characteristic of feature selection, meta-heuristics are introduced into feature selection in biomedicine on account of their excellent global search ability. However, most of biomedical problems are characterized by high dimensionality, which is a challenge for feature selection methods based on meta-heuristics due to the curse of dimensionality. Thus, six meta-heuristics, that is, a genetic algorithm, particle swarm optimization, ant colony optimization, harmony search, differential evolution, and quantum-inspired evolutionary algorithm, which are widely studied in the meta-heuristic community, are introduced into feature selection in this paper and the performance of the algorithms is analysed and compared with each other for solving feature selection in biomedicine effectively. To evaluate the search ability of the algorithms fairly and exactly, a set of feature selection benchmark problems are designed and yielded for the performance tests. The experimental results show that all the meta-heuristics are powerful enough to achieve the ideal results on low-dimensional feature selection problems, while it is essential to choose a proper algorithm for the high-dimensional ones.