Improved NSGA-II algorithms for multi-objective biomarker discovery

Abstract

Motivation: In modern translational research, the development of biomarkers heavily relies on use of omics technologies, but implementations with basic data mining algorithms frequently lead to false positives. Non-dominated Sorting Genetic Algorithm II (NSGA2) is an extremely effective algorithm for biomarker discovery but has been rarely evaluated against large-scale datasets. The exploration of the feature search space is the key to NSGA2 success but in specific cases NSGA2 expresses a shallow exploration of the space of possible feature combinations, possibly leading to models with low predictive performances.

Results: We propose two improved NSGA2 algorithms for finding subsets of biomarkers exhibiting different trade-offs between accuracy and feature number. The performances are investigated on gene expression data of breast cancer patients. The results are compared with NSGA2 and LASSO. The benchmarking dataset includes internal and external validation sets. The results show that the proposed algorithms generate a better approximation of the optimal trade-offs between accuracy and set size. Moreover, validation and test accuracies are better than those provided by NSGA2 and LASSO. Remarkably, the GA-based methods provide biomarkers that achieve a very high prediction accuracy (>80%) with a small number of features (<10), representing a valid alternative to known biomarker models, such as Pam50 and MammaPrint.

Availability and implementation: The software is publicly available on GitHub at github.com/UEFBiomedicalInformaticsLab/BIODAI/tree/main/MOO.

Supplementary information: Supplementary data are available at Bioinformatics online.