Gene selection for microarray data classification via subspace learning and manifold regularization

Area of Science:

• Genomics
• Bioinformatics
• Machine Learning

Background:

• Microarray technology generates vast genomic data, posing challenges for classification due to high dimensionality and limited samples.
• Effective gene selection is crucial for improving the accuracy and efficiency of microarray data classification.

Purpose of the Study:

• To develop an effective gene selection method for microarray data.
• To remove irrelevant and redundant genes to enhance classification performance.
• To formulate gene selection as a manifold regularized subspace learning problem.

Main Methods:

• Proposed a projection matrix to reduce high-dimensional microarray data into a lower-dimensional subspace.
• Incorporated Laplacian graph regularization to preserve the local manifold structure.
• Developed an iterative update algorithm to solve the formulated problem.

Main Results:

• The selected gene subset significantly benefits the classification task compared to original data.
• Experimental results on multiple microarray and clinical datasets demonstrated superior performance over state-of-the-art methods.
• The projection matrix effectively indicates gene importance.

Conclusions:

• The proposed manifold regularized subspace learning method is effective for gene selection in microarray data classification.
• This approach offers a robust solution for handling high-dimensional genomic data.
• The method shows significant potential for improving diagnostic and prognostic applications in genomics.