Improving the computational efficiency of recursive cluster elimination for gene selection.
The gene expression data are usually provided with a large number of genes and a relatively small number of samples, which brings a lot of new challenges. Selecting those informative genes becomes the main issue in microarray data analysis. Recursive cluster elimination based on support vector machine (SVM-RCE) has shown the better classification accuracy on some microarray data sets than recursive feature elimination based on support vector machine (SVM-RFE). However, SVM-RCE is extremely time-consuming. In this paper, we propose an improved method of SVM-RCE called ISVM-RCE. ISVM-RCE first trains a SVM model with all clusters, then applies the infinite norm of weight coefficient vector in each cluster to score the cluster, finally eliminates the gene clusters with the lowest score. In addition, ISVM-RCE eliminates genes within the clusters instead of removing a cluster of genes when the number of clusters is small. We have tested ISVM-RCE on six gene expression data sets and compared their performances with SVM-RCE and linear-discriminant-analysis-based RFE (LDA-RFE). The experiment results on these data sets show that ISVM-RCE greatly reduces the time cost of SVM-RCE, meanwhile obtains comparable classification performance as SVM-RCE, while LDA-RFE is not stable.
Luo
Lin-Kai
LK
Department of Automation, Xiamen University, Xiamen 361005, PR China. luolk@xmu.edu.cn
Huang
Deng-Feng
DF
Ye
Ling-Jun
LJ
Zhou
Qi-Feng
QF
Shao
Gui-Fang
GF
Peng
Hong
H
D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D016002:Discriminant Analysis; D020869:Gene Expression Profiling; D006801:Humans; D008297:Male; D009369:Neoplasms / Q000235:genetics / Q000378:metabolism; D020411:Oligonucleotide Array Sequence Analysis