- Open Access
Tumor classification ranking from microarray data
BMC Genomicsvolume 9, Article number: S21 (2008)
Gene expression profiles based on microarray data are recognized as potential diagnostic indices of cancer. Molecular tumor classifications resulted from these data and learning algorithms have advanced our understanding of genetic changes associated with cancer etiology and development. However, classifications are not always perfect and in such cases the classification rankings (likelihoods of correct class predictions) can be useful for directing further research (e.g., by deriving inferences about predictive indicators or prioritizing future experiments). Classification ranking is a challenging problem, particularly for microarray data, where there is a huge number of possible regulated genes with no known rating function. This study investigates the possibility of making tumor classification more informative by using a method for classification ranking that requires no additional ranking analysis and maintains relatively good classification accuracy.
Microarray data of 11 different types and subtypes of cancer were analyzed using MDR (Multi-Dimensional Ranker), a recently developed boosting-based ranking algorithm. The number of predictor genes in all of the resulting classification models was at most nine, a huge reduction from the more than 12 thousands genes in the majority of the expression samples. Compared to several other learning algorithms, MDR gives the greatest AUC (area under the ROC curve) for the classifications of prostate cancer, acute lymphoblastic leukemia (ALL) and four ALL subtypes: BCR-ABL, E2A-PBX1, MALL and TALL. SVM (Support Vector Machine) gives the highest AUC for the classifications of lung, lymphoma, and breast cancers, and two ALL subtypes: Hyperdiploid > 50 and TEL-AML1. MDR gives highly competitive results, producing the highest average AUC, 91.01%, and an average overall accuracy of 90.01% for cancer expression analysis.
Using the classification rankings from MDR is a simple technique for obtaining effective and informative tumor classifications from cancer gene expression data. Further interpretation of the results obtained from MDR is required. MDR can also be used directly as a simple feature selection mechanism to identify genes relevant to tumor classification. MDR may be applicable to many other classification problems for microarray data.
Numerous studies have shown that cancer involve accumulated genetic aberrations in the cell. Advances in DNA microarray technology have revolutionized cancer research by enabling, within a given cell population, the simultaneous monitoring of the transcription and complex changes in the expression of thousands of genes during cancer development. This makes rapid genetic analysis for genome-wide cancer studies feasible. Researchers can quickly compare gene expressions between normal and malignant cells, and explore the genetic changes associated with cancer etiology and development. Microarray analysis offers promising avenues to the discovery of both new biomarkers for cancer diagnosis and prognosis and new treatments. Microarray data are being used to categorize tumors on the basis of their molecular profiles, to identify subtypes of tumors, to predict patients' responses to treatment and risk of relapse, and to explore the biological properties of tumors [1–7].
Recent cancer research has applied a variety of machine learning algorithms for tumor prediction by associating expression patterns with clinical outcomes for patients with tumors in various stages [3, 4, 8, 9]. Due to the distinctive huge dimensionality of the data, the majority of research has focused on building accurate classification models from reduced sets of features. The analysis aims to gain understanding of the differences between normal and malignant cells and to identify genes that are differentially regulated during cancer development. While this is useful, when classification models are not 100% accurate, the likelihoods of correctness for the class predictions (i.e., classification ranking) can be useful for further research (e.g., deriving inferences for predictor genes and prioritizing experiments). For example, some of the genetic abnormalities in malignant cells may be the most important contributing factors for cancer. Classification ranking is a challenging problem, particularly in microarray data, which has a huge number of factors whose relative importance is largely unknown. Most machine learners focus on classification and do not explicitly assess the likelihood of correctness for their class predictions, unless additional analysis is performed.
This paper describes a simple microarray data analysis technique for tumor classification ranking. In particular, we apply MDR, our recently developed Multi-Dimensional Ranking algorithm, for analyzing gene expression in various types of cancers including leukemia, lung, prostate, lymphoma, and breast cancers. These data have been used in previous cancer research studies [1, 3, 5–8, 10]. They are publicly available and can be obtained from the Kent Ridge Biomedical Data Set Repository .
We analyze microarray data for 11 types and subtypes of tumors using MDR. The two Leukemia expression data sets are concerned with classification of acute lymphoblastic leukemia (ALL). Golub et al.  used the ALL-AML Leukemia expressions to help discover a single diagnostic test to differentiate between two types of human acute leukemia: acute myeloid leukemia (AML) and ALL. The ALL-subtype expression data were used by Yeoh et al.  to identify six known prognostically important leukemia subtypes of ALL from pediatric ALL patients. These ALL subtypes include: BCR-ABL, E2A-PBX1, Hyperdiploid > 50 chromosomes, MALL, T-ALL, and TEL-AML1. Because different leukemia types and subtypes respond to chemotherapy differently, the ability to determine the classification of an ALL subtype for a new leukemia tissue sample can be valuable for cancer treatment. MDR has been designed for binary classification ranking. When dealing with multiple classes, we employ the "one against many" strategy (i.e., for each class, perform a binary classification between that class and all the other classes). As recommended in a recent study by Li and Liu , we divide the ALL-subtype expression data into six cases, each of which focuses on classification of a particular ALL subtype against all the other subtypes. The ALL classification model (or classifier) obtained from MDR contains two predictor genes, whereas the number of predictor genes in the classifiers for the six ALL subtypes ranges from one to nine. This is a huge reduction from the original number of genes, over 12,000, in the ALL-AML and ALL subtype expression data.
The lung cancer data are analyzed to distinguish between malignant pleural mesothelioma (MPM) and adenocarcinoma (ADCA) , whereas the prostate and breast profile expression data are analyzed for tumor diagnosis and prognosis (e.g., "relapse" in patients who developed distance metastates within five years), respectively [5, 6]. The lymphoma microarray data include gene expressions of diffuse large B-cell lymphoma, a subtype of non-Hodgkin's lymphoma . To indicate different stages of B-cell malignancies, gene expression patterns studied are of two types: the germinal centre B-like type and the activated B-like type. Patients with the germinal centre B-like type have had better survival rates. The classification models obtained by MDR from the lung, prostate, lymphoma and breast expression data contain five, six, three and eight predictor genes, respectively. The predictor genes in each of these MDR classification models, derived from the corresponding expression data sets, are shown in Table 1. While constructing the classification model, MDR reduces the number of data dimensions to a smaller number, selecting features relevant for classification ranking in the model. Unlike the machine learners that require an additional step for feature selection, MDR does not do feature selection as a separate step. MDR could be viewed as an alternative, simple method for a boosting-based feature selection technique. However, proper verification of MDR's effectiveness as a method for feature selection would require research beyond the scope of this paper.
The performance of MDR is compared to that of other high performance machine learners in Weka . Figure 1 shows a comparison of ROC curves obtained from MDR and five other learners (ZeroR, C4.5, Bayes, 3NN, and SVM) for the prostate cancer data set. The ZeroR learner predicts values based on the majority of the class distribution and is commonly used as a baseline measure of performance. As expected, ZeroR shows performance equivalent to random guessing, giving an ROC curve close to a diagonal line. Therefore, it has no predictive power. The ROC curves obtained from C4.5 and Bayes show better performance than ZeroR. The top three performers appear to be MDR, 3NN and SVM. Both MDR and SVM dominate the others but we cannot draw a firm conclusion on comparative performance by looking at the ROC curve alone. While the ROC curve is effective for ranking quality, it is not always conclusive. Thus, our analysis employs alternative standard performance measures (as described in the Method section), including recall (true positive rate, sensitivity, hit rate), FPR (false positive rate, false alarm rate, type I error), FNR (false negative rate, type II error), ACC (accuracy), AUC (area under ROC curve) and precision. The results of these measures (shown as average percentages over 10-fold cross validation) obtained from six learners are given in Table 2, for the classification of five types of cancer, and Table 3, for the classification of six subtypes of acute lymphoblastic leukemia (ALL).
Consider the results shown in Table 2. For prostate cancer, the AUCs obtained by all the learners are consistent with the observations from the ROC curves shown in Figure 1, but now we can make conclusive comparisons. Based on AUC, MDR, at 92.3%, and is slightly better than SVM, 91%. However, when considering all other measures, SVM generally performs better than MDR with differences of no more than 3.39%. AUC ranks the results differently than the other measures because it is a more suitable measure for ranking evaluation. Nevertheless, MDR outperforms 3NN by larger differences (9.56% in accuracy, 10.34% in precision, 15.25% in FPR (Type I error) and about 5% in AUC, recall and FNR (Type II error)). Both the accuracies and AUCs obtained from C4.5 and Bayes are much lower than those of MDR. For prostate cancer classification, MDR can rank well (with over 90% AUC) while its classification quality remains competitive with the other learners (close to 90% for accuracy, recall and precision).
For ALL-AML Leukemia, the top three performers are SVM, Bayes and MDR. All have the same FPR of 4%. SVM and Bayes have the highest recall, accuracy, precision and the lowest FNR. However, MDR has the best AUC of 99.02%, and the second best values for the other measures, with precision lower by only 0.04%, accuracy lower by about 1%, and differences in FNR and recall of about 2%. This is similar to the results obtained in prostate cancer. However, here SVM and Bayes give highly competitive results in all measures except AUC. On the other hand, MDR has reasonably high precision, accuracy and recall (97.87%, 97.22%, and 97.87%, respectively). MDR performs very well on the classification ranking of ALL. MDR's performance on lung cancer is similar to its performance on lymphoma cancer. For lung cancer, SVM, Bayes and MDR consistently performed better than the rest. The AUC and ACC obtained by MDR were 0.39% and 2.76% lower than those of the top performer, but it still has over 90% on almost all measures, with a low 2% FPR. Unfortunately, the 9.68% for FNR obtained by MDR is rather high, but still better than the 12.9% and 35.48% of C4.5 and 3NN, respectively. In the lymphoma cancer analysis, Bayes and SVM are top performers, followed by MDR. The AUC for MDR is 93.61%, which is 4.29% lower than that of Bayes and SVM. Compared to MDR, 3NN has 4.17% lower FPR (type I error) but 25.8% higher FNR (type II error), which is usually a more critical measure for tumor prediction. The ACC and AUC obtained by C4.5 and 3NN are not competitive to those obtained by MDR.
All the machine learners had poor results for the breast cancer data. Furthermore, the results obtained from different measures are not consistent. For example, Bayes has 100% precision but very low AUC and ACC of only about 50–55%, and an extremely high Type II error of about 95%. This suggests that the data are probably very skewed. The results obtained from SVM are the best with AUC, ACC and recall all close to 70%. However, its precision is only 65%, and it has very high type I & II errors of about 30%. MDR does not perform well. Nevertheless, the majority of its results rank second best among all the learners. We now discuss the results obtained in the ALL subtype classification as shown in Table 3. For the classification of subtypes E2A-PBX1 and T-ALL, MDR has perfect averages in all measures. For the subtype BCR-ABL, although MDR has the highest AUC, 88.48%, and high accuracy, 92.66%, (3.98% lower than the accuracy obtained by the best learner, SVM), it has low precision, low recall, and high FNR, about 80%. The results obtained by the other learners also show similar inconsistency across different measures. Thus, for BCR-ABL classification, all learners are likely to perform well but with high variances. For the rest of the ALL subtypes: Hyperdiploid > 50 chromosomes (HYP > 50), MALL and TEL-AML1, the results are similar in that the top three performers are SVM, 3NN, and C4.5 on almost all measures except AUC. However, MDR gives reasonably high accuracy, ranging from 80% to 93%, and AUC ranging from 85% to 91%. Since AUC is the area under the ROC curve, which is a plot between TPR and FPR, it may seem strange that a lower TPR and higher FPR can yield a higher AUC. However, this is possible when multiple points on the curve are considered (e.g., results obtained by MDR and C4.5 in HYP > 50). This is why AUC is one of the most widely used measures for evaluating probabilistic classification models .
To better understand MDR's performance for various types of cancer microarray data analyses, Table 4 focuses on comparisons of AUC in average percentages over 10-fold cross validations. For each type and subtype of tumor classification, the base line performance (ZeroR) gives an average AUC ranging from 41.4% to 49.7%. This follows the expected behavior of the ROC no-discrimination line, which implies that there is about 50% chance that a randomly selected sample of a target class (tumor) has a higher estimated probability of being predicted than a randomly selected sample from a non-target class (normal). For each data set, Table 4 shows the highest AUC in bold. MDR gives the highest AUC for the classifications of ALL-AML and Prostate, and four ALL subtypes: BCR-ABL, E2A-PBX1, MALL and TALL. SVM gives the highest AUCs for the rest. In the former group of classifications, SVM underperforms MDR with AUC differences ranging from 1% to 25.2%, whereas in the latter group, MDR underperforms SVM with AUC differences ranging from 0.4% to 7.9%. Specifically, SVM does poorly in BCR-ABL with an AUC 25.2% lower than the best AUC, obtained by MDR, whereas MDR has the largest AUC difference in subtype Hyp > 50 with an AUC 7.9% lower than that of SVM, the best performer. For the lymphoma cancer, SVM ties with Bayes for the best AUC, 97.9%, while MDR is competitive with an AUC of 93.6%. For classification of subtypes E2A-PBX1, MDR and C4.5 both have an AUC of 100%. Neither MDR nor SVM perform well on breast cancer, with AUCs of 63.7% and 68.1%, respectively. In terms of overall average AUCs, SVM and MDR outperform the other learners. MDR performs best on six of the eleven classification test cases and has an average AUC over all eleven cases of 91.01%. The overall average AUC obtained from SVM is 90.07%, and SVM has the best performance for five of the data sets. However, the difference between the average AUCs of MDR and SVM is not statistically significant.
Therefore, we can conclude that MDR is at least competitive to the other learners. In addition, recall that MDR provides the additional information of ranking predictions. We note that, unlike other learners, the AUC obtained from Weka for SVM is based on an ROC curve created using a single point (e.g., see Figure 1). Since SVM is a binary classifier that is not designed for classification ranking, this may seem to be a reasonable way to estimate AUC. However, this method may result in an optimistic AUC for SVM whenever SVM has high accuracy. Another observation is that MDR's performance may associate with the class distribution in the sample data. When the class distribution is extremely unbalanced, MDR does better than other learners. For example, in all subtype classifications of ALL, for which MDR outperformed other learners, the proportion of the target class is at most 15%. In particular, the proportions of the target class for subtypes BCR-ABL, E2A-PBX1, MALL and T-ALL are 0.04, 0.09, 0.06 and 0.15, respectively. To further compare the performance of MDR and SVM, we ran additional experiments (on a PC with a 3.2 GHz Pentium Processor and 3.6 GByte of RAM) with the TIS (Translation Initiation Sites) data obtained from [10, 11]. Although these are vertebrate genomic sequences and not gene expression data, the TIS data set differs from all of the above expression data sets in that it has a much higher number of instances (13,375) than the number of attributes (927) with a class distribution ratio of about 25%. Our results show that while both SVM and MDR give the same AUC of 0.82, the training time of SVM is 1080.39 sec., which is significantly higher than MDR's training time of 84.26 sec. This shows that SVM is suitable for high dimensional data while MDR appears to be robust for data with high dimension and volume.
This paper investigates the potential of MDR, a recently developed ranking algorithm, for obtaining effective and informative tumor classifications from gene expression data. MDR gives promising results with an average AUC of 91.01% and accuracy of 90.01% over 11 types and subtypes of cancers. The results show that MDR is competitive with other widely used high performance machine learners for microarray data analysis. Based on our experiments, MDR appears to be robust to unbalanced data and performs well even when the tumor class distribution is extremely unbalanced. In addition, MDR provides explicit assessment of classification rankings. MDR's accuracy in classifying different types of tumor is relatively high (close to 90%) on all types of cancer except breast cancer, where the accuracy and AUC obtained by MDR are about 63%. However, even SVM, which is the top performer for breast cancer, has accuracy and AUC of only about 68%. This implies that the breast cancer data used for the analysis may not have the structure and patterns that allow types of tumors to be discriminated. MDR performed very well on classifying all six subtypes of acute lymphoblastic leukemia, with the classification for subtype Hyp > 50 being the least accurate. Our work is preliminary and has been validated only on a limited number of data sets. Future work could include an investigation on the effects of the number of boosting rounds required by MDR during training, fine-tuning and experimentation with additional data sets to see how tolerant MDR is to noisy and inconsistent data. Further interpretation of the results obtained from MDR is required. Furthermore, since MDR can be viewed as a feature selection tool that is very simple and fast, it would be interesting to see if MDR can be applied for this purpose. These issues are part of our ongoing research.
The MDR algorithm
MDR (Multi-Dimensional Ranker) is a machine learning algorithm for constructing a predictive model (classifier) that ranks each sample in a data set based on its likelihood of being the member of a target class. In expression profiling data analysis, a typical target class represents a type of disease (e.g., a type or subtype of cancer). The algorithm is based on the Martingale boosting technique . Intuitively, boosting iteratively uses results from one learner to tune the training instances so that learning in the next boosting round can incrementally improve prediction accuracy. Figure 2 shows basic steps of MDR.
In each boosting round, MDR performs a greedy search to select an appropriate attribute and its sorting order (increasing or decreasing) in each partition to improve the ranking pattern of target class samples in a given training data set. The selection is biased towards the ideal ranking, where samples are ordered from those with highest probability of being in the target class to the lowest. During the search, MDR uses a heuristic evaluation function, R as a rating function to compare lists (in a selected partition) sorted on different attributes in both increasing and decreasing orders. The partitioning condition ensures that the class attribute values (e.g., disease or non-disease) are well distributed in each partition for training. If the condition cannot be satisfied exactly, having the same number of target class instances is preferred (to having the same proportion of target class instances).
We now define the rating function for L = [s1, s2,..., s n ], a list of samples in a partition of the training set. Let d i = 1 if a sample s i is a member of the target class and d i = 0 otherwise. We define rating of L as follows:
The rating is biased to ranking patterns that have target class members at the top of the list and non-target class members at the bottom. Ratings can range from 0 to d(n - d)/n where d is the total number of samples that belong to the target class. Note that smaller rating values are better. For example, consider lists L1 = [0, 0, 1, 1], L2 = [0, 1, 0, 1], and L3 = [1, 1, 0, 0]. It is clear that L3 is the most desirable since target class members are all towards the top of the list and L1 is the least desirable. This is consistent with the heuristic values: R(L1) = 1, R(L2) = 3/4, and R(L3) = 0.
The output model is a list of triplets of the form (A, s, p), where A, s and p represent an attribute, a sorting order type (Inc for increasing, Dec for decreasing) and a ratio of the partition size to the number of training instances, respectively. Figure 3 shows an example of the model generated by MDR on a data set when the total number of boosting round is specified to be 3. The list of triplets for each partition in each boosting round is shown, where A i represents attribute i of the data set.
To apply the model to a given set of testing data instances, the list is repeatedly sorted according to the attributes selected by the model. For example, if we use the model in Figure 3, we will first sort the whole list according to attribute A14 in decreasing order. Next (in round 2), we partition the sample list into two parts with the top part containing 20% of the total number of testing samples. We sort the top partition by attribute A12 in decreasing order and sort the bottom partition by attribute A10 in increasing order.
Finally, in round 3, we partition the list into three parts: the top and middle parts contain 12% and 18% of the total number of testing instances, respectively. The rest are in the last partition. In the top partition, NULL signifies that no attribute is selected and therefore there is no sorting required. Thus, this top partition remains unchanged. We then sort the middle and bottom partitions in decreasing order by attributes A7 and A11, respectively. The resulting list gives the ranking predictions.
Unlike most machine learners, MDR is specifically designed to produce ranking models. The proposed MDR algorithm is similar to the MartiRank algorithm employed in the ROAM system  in that both are based on Martingale Boosting . However, MDR differs slightly from MartiRank in that it uses a different heuristic evaluation function. Furthermore, MDR records each partition boundary in terms of the ratio of its size to the total number of training instances, whereas MartiRank uses an absolute boundary location. Consequently, MDR is more general than MartiRank in that MDR can be applied to testing data sets of any size whereas MartiRank can only be applied to those with the same size as the training data set. Currently, MDR, implemented in Java, interfaces, at certain levels, with Weka, a popular data mining tool  in order to facilitate valid comparisons of results obtained from MDR and other machine learners provided by Weka.
The performance metrics
To evaluate the quality of our classification models, we employ various standard performance measures; ideally, different measures provide different insights. In machine learning, modeling involves classification or prediction that associates patterns from data points with classes that express different concepts. One of the most popular performance measures in machine learning classification is accuracy (ACC), which is defined to be the ratio of the number of correct predictions to the total number of instances in the test sample. However, ACC does not make use of the nature of the incorrect predictions, which can be useful in many domains including tumor classification.
Consider, for example, a model that classifies data points into the binary classes: positive and negative, as shown in Figure 2. TP (True Positive) represents the number of positive samples correctly classified, whereas FP (False Positive) represents the number of negative samples incorrectly classified as positive. TN (True Negative) and FN (False Negative) are defined symmetrically. ACC is computed as (TP+TN)/(TP+FP+TN+FN) and does not take into account the difference between false alarms (type I errors), measured by FP, and missed detections (type II errors), measured by FN. The latter value is particularly important in clinical medicine and defect management. Furthermore, ACC can be especially misleading when the distribution of the sample class is unbalanced. For example, a model can achieve 90% accuracy on a sample in which only 10% of the data points are positive simply by classifying every instance as negative, even though all of its classifications for positive samples are incorrect.
As shown in Figure 4, a variety of metrics have been defined to measure different types of errors. In particular, TPR (True Positive Rate) is defined to be the ratio of positives correctly classified to the actual number of positives, and FPR (False Positive Rate) is defined to be the ratio of negatives incorrectly classified to the actual number of negatives. TPR is also called the hit rate, recall, or sensitivity. FPR is also referred to as the false alarm rate. Similarly, specificity is defined as the ratio of correctly classified negatives to the actual number of negatives. TPR and specificity are independent, i.e., neither one tells us anything about the value of the other. Note that the sum of specificity and FPR is one, and thus, knowing one allows us to calculate the other. Another useful metric is precision (PREC), the ratio of correctly classified positives over the total number of samples classified as positive.
In this paper we also use AUC (Area Under the ROC Curve) as an additional performance metric. The ROC curve is a two-dimensional plot between the TPR (Y-axis) against the FPR (X-axis) of the predictions. The values of TPR and FPR range from zero to one. The set of points (FPR, TPR) defines the ROC space. Given a ranking list of sample predictions, each sample point in the list can be used as a cutoff point. For each cutoff point, the corresponding TPR and FPR can be computed and plotted as a single point in ROC space. Connecting these points gives the ROC curve for the list of predictions. ROC curves can be used to compare predictions. The closer the curve is to the Y-axis (high true positives) and the further away it is from the X-axis (low false positives), the more accurate the predictions are. When predictions are made by random guessing, TPR and FPR grow linearly yielding an ROC curve, which is a straight line 45 degrees from the horizontal. This is referred to as the no-discrimination line .
Unfortunately, using ROC curves for performance comparisons does not necessary give conclusive results since one ROC curve may dominate another in one region but be dominated in a different region. According to , the AUC of a learner can be interpreted as the probability that, given a randomly chosen positive and negative example, the learner will give a higher ranking to the positive example than to the negative. Thus, AUC (the area under the ROC curve) is used as a value to compare the performance of different learners on a data set. The higher the AUC, the better the learner. Our study uses AUC to evaluate ranking quality . AUC has been shown to be equivalent to the Wilcoxon statistic rank test  and, in fact, is a better measure for evaluating predictive ability of machine learners than accuracy . Most researchers have now adopted AUC as the standard performance metric. Figure 5 illustrates three ROC curves obtained by applying the same classification model to the same testing sample using either different orderings for the testing data or using a different number of cutoff points. In particular, ROC1 and ROC2 are plotted using multiple cutoff points as the model incrementally classifies each testing instance, whereas ROC3 uses a single point to create the ROC curve with a cutoff point where all testing instances have been classified. ROC1 and ROC2 are obtained from the same testing instances but in different orders. Even though all the three classification results have the same accuracy, they have different AUCs. AUC is more sensitive to the order of classification ranking than it is to accuracy.
We use microarray gene expression data for leukemia, lung, prostate, lymphoma, and breast cancers. These are real-world expression profiling data sets that are used in various types of cancer research [1, 3, 5–8, 12]. They can be obtained from the Kent Ridge Biomedical Data Set Repository .
Table 5 gives a summary of the basic characteristics of these data sets, including the subject of the study, number of features (which represent, for example, genes or probing conditions of the microarray profiling experiments) and number of samples (cells or tissues from different patients). Each data set is concerned with a binary classification for different types or subtypes of cancers. The last two columns of Table 5 show the names of the target (e.g., tumor or type of cancer) and non-target classes and the number of instances of each. All data represent the expression levels and durations of the expressed genes. The last six rows of Table 5 represent expression data for binary classifications of six different subtypes of acute lymphoblastic leukemia (ALL). One characteristic shared by all these expression data sets is high dimensionality (many factors) but low volume (few sample points). As shown in Table 5, the dimensions range from 4,026 to 15,154, whereas the volumes range from 47 to 327. This characteristic is well known to challenge many existing microarray data analysis techniques.
To avoid overfitting, n-fold cross-validation , a standard re-sampling technique, is used. In n-fold cross validation, a data set is randomly partitioned into n approximately equally sized subsets (or folds or tests). The learning algorithm is executed n times; each time it is trained on the data that is outside one of the subsets and the generated model (classifier) is tested on that subset. The estimated accuracy for each cross-validation test is a random variable that depends on the random partitioning of the data. The estimated accuracy is computed as the average accuracy over the n test sets. Typically n-fold cross-validations are repeated several times to assure data randomness, and the estimated accuracy is the average over these repetitions. In this paper, we use the number of folds, n = 10, as is standard practice. For efficiency control, MDR allows a user to specify the number of boosting rounds (T). In this study, we use T = 5 as the number of rounds. A method for selecting the best T is a subject for future research. We ran 10-fold cross validations on all eleven test cases of the six data sets using our MDR ranking algorithm and five other machine learning approaches, which are available on Weka . The other five machine learners are ZeroR, C4.5, Bayes, k-NN and SVM [2, 12, 17, 18]. ZeroR is a majority learner that is commonly used to provide a baseline measure of performance in machine learning. C4.5 is a decision tree learner, Bayes is a well known Naive Bayes classifier, and k-NN is a nearest-neighbor classifier, for which we specify the number of neighbors to be k = 3 (as in ). The support vector machine learner, SVM, is known to have high performance and is widely used in Bioinformatics. The five learners were selected for comparison because they perform well and cover a variety of techniques that use different representational models; for example decision tree models for C4.5, probabilistic models for Bayes, and regression models for SVM.
Alizadeh AA, Eisen MB, Davis RE, Ma C, Lossos IS, Rosenwald A, Boldrick JC, Sabet H, Tran T, Yu X, Powell JI, Yang L, Marti GE, Moore T, Hudson J, Lu L, Lewis DB, Tibshirani R, Sherlock G, Chan WC, Greiner TC, Weisenburger DD, Armitage JO, Warnke R, Levy R, Wilson W, Grever MR, Byrd JC, Botstein D, Brown PO, Staudt LM: Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature. 2000, 403: 503-511. 10.1038/35000501. [http://dx.doi.org/10.1038/35000501]
Burges CJC, Schölkopf B: Improving the Accuracy and Speed of Support Vector Machines. Advances in Neural Information Processing Systems. Edited by: Mozer MC, Jordan MI, Petsche T. 1997, The MIT Press, 9: 375-[http://citeseer.ist.psu.edu/burges97improving.html]
Gordon GJ, Jensen RV, Hsiao LL, Gullans SR, Blumenstock JE, Ramaswamy S, Richards WG, Sugarbaker DJ, Bueno R: Translation of Microarray Data into Clinically Relevant Cancer Diagnostic Tests Using Gene Expression Ratios in Lung Cancer and Mesothelioma. Cancer Res. 2002, 62: 4963-4967. [http://cancerres.aacrjournals.org/cgi/content/abstract/62/17/4963]
Li J, Liu H, Ng SK, Wong L: Discovery of significant rules for classifying cancer diagnosis data. Bioinformatics. 2003, 19: ii93-102. [http://bioinformatics.oxfordjournals.org/cgi/content/abstract/19/suppl_2/ii93]
Singh D, Febbo PG, Ross K, Jackson DG, Manola J, Ladd C, Tamayo P, Renshaw AA, D'Amico AV, Richie JP, Lander ES, Loda M, Kantoff PW, Golub TR, Sellers WR: Gene expression correlates of clinical prostate cancer behavior. Cancer cell. 2002, 1: 203-9. 10.1016/S1535-6108(02)00030-2. [PMID: 12086878].
van 't Veer LJ, Dai H, Vijver van der MJ, He YD, Hart AAM, Mao M, Peterse HL, Kooy van der K, Marton MJ, Witteveen AT, Schreiber GJ, Kerkhoven RM, Roberts C, Linsley PS, Bernards R, Friend SH: Gene expression profiling predicts clinical outcome of breast cancer. Nature. 2002, 415: 530-536. 10.1038/415530a. [http://dx.doi.org/10.1038/415530a]
Yeoh EJ, Ross ME, Shurtleff SA, Williams WK, Patel D, Mahfouz R, Behm FG, Raimondi SC, Relling MV, Patel A, Cheng C, Campana D, Wilkins D, Zhou X, Li J, Liu H, Pui CH, Evans WE, Naeve C, Wong L, Downing JR: Classification, subtype discovery, and prediction of outcome in pediatric acute lymphoblastic leukemia by gene expression profiling. Cancer cell. 2002, 1: 133-43. 10.1016/S1535-6108(02)00032-6. [PMID: 12086872].
Golub TR, Slonim DK, Tamayo P, Huard C, Gaasenbeek M, Mesirov JP, Coller H, Loh ML, Downing JR, Caligiuri MA, Bloomfield CD, Lander ES: Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science (New York, N.Y.). 1999, 286: 531-7. [PMID: 10521349].
Li J, Liu H: Ensembles of Cascading Trees. Proceedings of the Third IEEE International Conference on Data Mining. 2003, IEEE Computer Society, 585-
Pedersen AG, Nielsen H: Neural network prediction of translation initiation sites in eukaryotes: perspectives for EST and genome analysis. Proceedings/... International Conference on Intelligent Systems for Molecular Biology; ISMB. International Conference on Intelligent Systems for Molecular Biology. 1997, 5: 226-33. [PMID: 9322041].
Li J, Liu H: Kent Ridge Biomedical Data Set Repository. 2007, [http://sdmc.lit.org.sg/GEDatasets/Datasets.html]
Witten IH, Frank E: Practical Machine Learning Tools and Techniques. 2005, Elsevier
Huang J, Ling CX: Using AUC and Accuracy in Evaluating Learning Algorithms. 2005, IEEE Educational Activities Department, 17:
Long , Servedio : Martingale Boosting. 2005, [http://dx.doi.org/10.1007/11503415_6]
Gross P, Boulanger A, Arias M, Waltz DL, Long PM, Lawson C, Anderson R, Koenig M, Mastrocinque M, Fairechio W, Johnson JA, Lee S, Doherty F, Kressner A: Predicting Electricity Distribution Feeder Failures Using Machine Learning Susceptibility Analysis. Proceedings, The Twenty-First National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, July 16–20, 2006, Boston, Massachusetts, USA. 2006
Green DM, Swets JA: Signal Detection Theory and Psychophysics. 1989, Peninsula Publishing
Cover T, Hart P: Nearest neighbor pattern classification. Information Theory, IEEE Transactions on. 1967, 13: 21-27. 10.1109/TIT.1967.1053964.
Quilan JR: C4.5: Programs for Machine Learning. 1993, Morgan Kaufmann
This article has been published as part of BMC Genomics Volume 9 Supplement 2, 2008: IEEE 7th International Conference on Bioinformatics and Bioengineering at Harvard Medical School. The full contents of the supplement are available online at http://www.biomedcentral.com/1471-2164/9?issue=S2
The authors declare that they have no competing interests.
RH designed the study, performed analysis of the micro array data and wrote the draft manuscript. PK implemented the proposed algorithm, performed the experiments and assisted in the analysis of the data. Both authors participated in production of the final version of the manuscript, read it and approved it.