title: A greedy algorithm for gene selection based on SVM and correlation.
abstract: Microarrays serve scientists as a powerful and efficient tool to observe thousands of genes and analyse their activeness in normal or cancerous tissues. In general, microarrays are used to measure the expression levels of thounsands of genes in a cell mixture. Gene expression data obtained from microarrays can be used for various applications. One such application is that of gene selection. Gene selection is very similar to the feature selection problem addressed in the machine-learning area. In a nutshell, gene selection is the problem of identifying a minimum set of genes that are responsible for certain events (for example the presence of cancer). Informative gene selection is an important problem arising in the analysis of microarray data. In this paper, we present a novel algorithm for gene selection that combines Support Vector Machines (SVMs) with gene correlations. Experiments show that the new algorithm, called GCI-SVM, obtains a higher classification accuracy using a smaller number of selected genes than the well-known algorithms in the literature.
authors.affiliation: Department of Computer Science and Engineering, University of Connecticut, Storrs 06269, CT, USA. mjsong@engr.uconn.edu
authors.forename: Mingjun
authors.initials: M
authors.lastname: Song
authors.forename: Sanguthevar
authors.initials: S
authors.lastname: Rajasekaran
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D015870:Gene Expression; D020869:Gene Expression Profiling; D020411:Oligonucleotide Array Sequence Analysis / Q000379:methods; D010363:Pattern Recognition, Automated / Q000379:methods