Affiliations: [a] Postdoctoral Mobile Station of Biology, College of Life Science, Henan Normal University, Xinxiang, China
| [b] College of Computer and Information Engineering, Henan Normal University, Xinxiang, China
Correspondence:
[*]
Corresponding author. Lin Sun, College of Computer and Information Engineering, Henan Normal University, Xinxiang, China. Email: [email protected].
Abstract: Gene selection as an important data preprocessing technique for cancer classification is one of the most challenging issues in the field of microarray data analysis. In this paper, to deal with gene expression data more effectively, a locally linear embedding (LLE) and neighborhood rough sets-based gene selection method using Lebesgue measure for cancer classification is proposed. First, to solve the problems that the traditional LLE method cannot effectively identify category information, and is susceptible to noise pollution and other issues, the intra-class neighborhood is defined and a new method of calculating reconstruction weight is proposed by combining with the Euclidean distance to improve LLE. Then, the Lebesgue measure is introduced into neighborhood rough sets, a δ-neighborhood measure is defined, and the dependency degree and the significance measure are presented in neighborhood decision systems. Finally, an improved LLE and neighborhood rough sets-based gene selection algorithm is designed, where the improved LLE algorithm is used to reduce the initial dimensions of gene expression data and obtain a candidate gene subset, and the Lebesgue measure and dependency degree-based relative reduction for gene expression data is developed to further screen the candidate subset to select the final gene subset. The experimental results under several public gene expression data sets prove that the proposed method is effective for selecting the most relevant genes with high classification accuracy.
Keywords: Rough sets, neighborhood rough sets, gene selection, locally linear embedding, cancer classification
