Overcoming the Curse of Dimensionality in Microarray Data Via Generative Data Augmentation and L1-Regularized Selection

Main Article Content

Fawzia A. E. Mansur
Issmail M. Ellabib

Abstract

Feature selection research is crucial to overcome the dimensionality curse. Despite numerous attempts to select features for high-dimensional data, many existing techniques suffer from limited computational efficiency and fail to capture complex and deep correlations among features, particularly in highly complex and low-sample-size. This article presents an innovative framework that uses conditional competitive generative networks (CGANs) to mitigate the limitations of differential evolution (DE)


and the low-dimensional, small-scale dataset problem (HDLSS) by increasing dataset size and improving the stability of the selection process, thereby enhancing the model's generalizability. Experimental results show that the model achieved a classification accuracy of 89.59%, surpassing the best reference method of 86.10%. This highlights the framework's effectiveness in balancing accuracy and computational efficiency, as well as its applicability to diverse high-dimensional data scenarios.

Article Details

How to Cite
Mansur, F. A. E. ., & Ellabib, I. M. . (2026). Overcoming the Curse of Dimensionality in Microarray Data Via Generative Data Augmentation and L1-Regularized Selection. Academy Journal for Basic and Applied Sciences, 8(1). https://doi.org/10.5281/zenodo.20761637
Section
Articles