A framework for high dimensional data reduction in the microarray domain

Publication Type:
Conference Proceeding
Proceedings 2010 IEEE Fifth Conference on Bio-Inspired Computing: Theories and Applications, 2010, pp. 903 - 907
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2010000921.pdf191.31 kB
Adobe PDF
Microarray analysis and visualization is very helpful for biologists and clinicians to understand gene expression in cells and to facilitate diagnosis and treatment of patients. However, a typical microarray dataset has thousands of features and a very small number of observations. This very high dimensional data has a massive amount of information which often contains some noise, non-useful information and small number of relevant features for disease or genotype. This paper proposes a framework for very high dimensional data reduction based on three technologies: feature selection, linear dimensionality reduction and non-linear dimensionality reduction. In this paper, feature selection based on mutual information will be proposed for filtering features and selecting the most relevant features with the minimum redundancy. A kernel linear dimensionality reduction method is also used to extract the latent variables from a high dimensional data set. In addition, a non-linear dimensionality reduction based on local linear embedding is used to reduce the dimension and visualize the data. Experimental results are presented to show the outputs of each step and the efficiency of this framework.
Please use this identifier to cite or link to this item: