Machine Learning Based Pattern Recognition Applied to Microarray Data

Abstract

Microarrays have allowed the expression level of thousands of genes or proteins to be measured simultaneously. Data sets generated by these arrays consist of a small number of observations (e.g., 20-100 samples) on a very large number of variables (e.g., 10,000 genes or proteins). The observations in these data sets often have other attributes associated with them such as a class label denoting the pathology of the subject. Finding the genes or proteins that are correlated to these attributes is often a difficult task since most of the variables do not contain information about the pathology and as such can mask the identity of the relevant features. We describe a genetic algorithm (GA) that employs both supervised and unsupervised learning to mine gene expression and proteomic data. The pattern recognition GA selects features that increase clustering, while simultaneously searching for features that optimize the separation of the classes in a plot of the two or three largest principal components of the data. Because the largest principal components capture the bulk of the variance in the data, the features chosen by the GA contain information primarily about differences between classes in the data set. The principal component analysis routine embedded in the fitness function of the GA acts as an information filter, significantly reducing the size of the search space since it restricts the search to feature sets whose principal component plots show clustering on the basis of class. The algorithm integrates aspects of artificial intelligence and evolutionary computations to yield a smart one pass procedure for feature selection, clustering, classification, and prediction.

Establishing glucose- and ABA-regulated transcription networks in Arabidopsis by microarray analysis and promoter classification using a Relevance Vector Machine

“…Learning techniques are used in an increasingly wide variety of biological applications such as microarray analysis (Lavine et al 2004), protein homology detection (Jaakkola et al 1999), function prediction based on annotated sequence (Vinayagam et al 2004), and functional predictions based on transcriptional coexpression (Zhang et al 2004). Supervised learning methods construct a decision rule from a training set of known positive and negative examples and algorithms such as Support Vector Machines (SVM) (Boser et al 1992) learn to discriminate between training examples from each category.…”

One stop shopping: feature selection, classification and prediction in a single step

“…Further information about the collection of this data can be found elsewhere [36]. In a previous study [37], these data were analyzed using PCKaNN and PCKaNN with the Hopkins statistic. However, the genetic algorithm used in this study was coded in MATLAB, which classified validation set samples versus 1 incorrectly classified), and the low classification success rates obtained by PCKaNN for the validation set samples.…”

Using OrPLS to identify asymptomatic women at risk for Alzheimer's disease

“…Other options for collinear data include ridging or ''shrinkage'' to stabilize the pertinent covariance matrices so that the classical discrimination paradigms can be implemented [4][5][6][7]. Alternatively, variable selection routines, often as part of genetic algorithm models, are another way to reduce the dimension of the data to the point that the relevant covariance constructs can be inverted (see, e.g., [8][9][10][11][12][13]). Other popular methods include flexible discriminant analysis [14] and penalized discriminant analysis [15] which are also variations on the ridging theme.…”