The Journal of Machine Learning Research
| Hi-index | 0.01 |
Array technologies have made it possible to record simultaneously the expression pattern of thousands of genes. A fundamental problem in the analysis of gene expression data is the identification of highly relevant genes that either discriminate between phenotypic labels or are important with respect to the cellular process studied in the experiment. Examples include: cell cycle or heat shock in yeast experiments, chemical or genetic perturbations of mammalian cell lines, and genes involved in class discovery for human tumors. We focus on the task of unsupervised gene selection. Selecting a small subset of genes is particularly challenging as the data sets involved are typically characterized by a small sample size and a very large feature space. We propose a model independent approach which scores candidate gene selections using spectral properties of the candidate af?nity matrix. The algorithm is simple to implement, yet contains a number of remarkable properties which guarantee consistent sparse selections. We applied our algorithm on five different data sets. The first consists of time course data from four well studied Hematopoietic cell lines (HL-60, Jurkat, NB4, and U937). The other four data sets include three well studied treatment outcomes (large cell lymphoma, childhood medulloblastomas, breast tumors) and one unpublished data set (lymph status). We compared our approach both with other unsupervised methods (SOM,PCA,GS) and with supervised methods (SNR,RMB,RFE). The results show that our approach considerably outperforms all the other unsupervised approaches in our study, is competitive with supervised methods and in some cases even outperforms supervised approaches.