MOBCSA: Multi-Objective Binary Cuckoo Search Algorithm for Features Selection in Bioinformatics

• Published in: IEEE access Vol. 12; pp. 21840 - 21867
• Main Authors: Abdulwahab, Hudhaifa Mohammed, Ajitha, S., Saif, Mufeed Ahmed Naji, Murshed, Belal Abdullah Hezam, Ghanem, Fahd A.
• Format: Journal Article
• Language: English
• Published: Piscataway IEEE 2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Accuracy; Algorithms; Archives & records; Bioinformatics; Cancer; Classification; Classification algorithms; Classifiers; cuckoo search algorithm; Data mining; Datasets; Diagnosis; Feature extraction; Features selection; Filtering algorithms; Genes; Heuristic algorithms; Machine learning; Medical diagnosis; Metaheuristics; multi-objective optimization; Multiple objective analysis; Performance evaluation; Search algorithms; Search methods; Search process; Transfer functions
• ISSN: 2169-3536; 2169-3536
• DOI: 10.1109/ACCESS.2024.3362228

In bioinformatics, medical diagnosis models might be significantly impacted by high-dimensional data generated by high-throughput technologies. This data includes redundant or irrelevant genes, making it challenging to identify the relevant genes from such high-dimensional data. Therefore, an effective feature selection (FS) technique is crucial to mitigate dimensionality, thereby enhancing the performance and accuracy of medical diagnosis. The Cuckoo Search Algorithm (CSA) has proven effective in gene selection, demonstrating prowess in exploitation, exploration, and convergence. However, most of the current CSA-based FS techniques deal with gene selection problems as a single objective rather than adopting a multi-objective mechanism. This article proposes the Multi-Objective Binary Cuckoo Search Algorithm (MOBCSA) for gene selection. MOBCSA extends the standard CSA by incorporating multiple objectives, including accuracy of classification and number of selected genes. MOBCSA utilizes an S-shaped transfer function for transforming the algorithm's search space from a continuous to a binary search space. MOBCSA integrates two components: an external archive to save the pareto optimal solutions attained during the search process, and an adaptive crowding distance updating mechanism integrated into the archive to maintain diversity and increase the coverage of optimal solutions. To assess MOBCSA's performance, evaluation experiments were conducted on six benchmark biomedical datasets using three different classifiers. Then, the obtained experimental results were compared against four multi-objective-based state-of-the art FS methods. The findings prove that MOBCSA surpasses the other methods in both accuracy of classification and number of selected genes, where it has obtained an average accuracy ranging from 92.79% to 98.42% and an average number of selected genes ranging from 15.67 to 27.88 for different classifiers and datasets.