Advances in Computational GenomicsView this Special Issue
Research Article | Open Access
Informative Gene Selection and Direct Classification of Tumor Based on Chi-Square Test of Pairwise Gene Interactions
In efforts to discover disease mechanisms and improve clinical diagnosis of tumors, it is useful to mine profiles for informative genes with definite biological meanings and to build robust classifiers with high precision. In this study, we developed a new method for tumor-gene selection, the Chi-square test-based integrated rank gene and direct classifier (χ2-IRG-DC). First, we obtained the weighted integrated rank of gene importance from chi-square tests of single and pairwise gene interactions. Then, we sequentially introduced the ranked genes and removed redundant genes by using leave-one-out cross-validation of the chi-square test-based Direct Classifier (χ2-DC) within the training set to obtain informative genes. Finally, we determined the accuracy of independent test data by utilizing the genes obtained above with χ2-DC. Furthermore, we analyzed the robustness of χ2-IRG-DC by comparing the generalization performance of different models, the efficiency of different feature-selection methods, and the accuracy of different classifiers. An independent test of ten multiclass tumor gene-expression datasets showed that χ2-IRG-DC could efficiently control overfitting and had higher generalization performance. The informative genes selected by χ2-IRG-DC could dramatically improve the independent test precision of other classifiers; meanwhile, the informative genes selected by other feature selection methods also had good performance in χ2-DC.
Tumors are the consequences of interactions between multiple genes and the environment. The emergence and rapid development of large-scale gene-expression technology provide an entirely new platform for tumor investigation. Tumor gene-expression data has the following features: high dimensionality, small or relatively small sample size, large differences in sample backgrounds, presence of nonrandom noise (e.g., batch effects), high redundancy, and nonlinearity. Mining of tumor-informative genes with definite biological meanings and building of robust classifiers with high precision are important goals in the context of clinical diagnosis of tumors and discovery of disease mechanisms.
Informative gene selection is a key issue in tumor recognition. Theoretically, there are possibilities in selecting the optimal informative gene subset from genes, which is an N-P hard problem. Available high-dimensional feature-selection methods often fall into one of the following three categories: (i) filter methods, which simply rank all genes according to the inherent features of the microarray data, and their algorithm complexities are low. However, redundant phenomena are usually present among the selected informative genes, which may result in low classification precision. Univariate filter methods include -test , correlation coefficient , Chi-square statistics , information gain , relief , signal-to-noise ratio , Wilcoxon rank sum , and entropy . Multivariable filter methods include mRMR , correlation-based feature selection , and Markov blanket filter ; (ii) wrapper methods, which search for an optimal feature set that maximizes the classification performance, defined in terms of an evaluation function (such as cross-validation accuracy). Their training precision and algorithm complexity are high; consequently, it is easy for over-fitting to occur. Search strategies include sequential forward selection , sequential backward selection , sequential floating selection , particle swarm optimization algorithm , genetic algorithm , ant colony algorithm , and breadth-first search . SVM and ANN are usually used for feature subset evaluation; (iii) embedded methods, which use internal information about the classification model to perform feature selection. These methods include SVM-RFE , support vector machine with RBF kernel based on recursive feature elimination (SVM-RBF-RFE) , support vector machine and T statistics recursive feature elimination (SVM-T-RFE) , and random forest .
Classifier is another key issue in tumor recognition. Traditional classification algorithms include Fisher linear discriminator, Naive bayes (NB) , K-nearest neighbor (KNN) , DT , support vector machine (SVM) , and artificial neural network (ANN) . There are dominant expressions in parametric models (e.g., Fisher linear discriminator) based on induction inference. The first goal for parametric models is to obtain general rules through training-sample learning, after which these rules are utilized to judge the testing sample. However, this is not the case for nonparametric models (e.g., SVM) based on transduction inference, which predict special testing samples through observation of special training samples, but classifiers needed for training. Training is the major reason for model over-fitting . Therefore, it is important to determine whether it is feasible to develop a direct classifier based on transduction interference that has no demand for training.
In recent years, several methods have been developed to perform both feature-selection and classification for the analysis of microarray data as follows: prediction analysis for microarrays (PAM), based on nearest shrunken centroids ; top scoring pair (TSP), based entirely on relative gene expression values ; refined TSP algorithms, such as k disjoint Top Scoring Pairs (k-TSP) for binary classification and the HC-TSP, HC-k-TSP for multiclass classification ; an extended version of TSP, the top-scoring triplet (TST) ; an extended version of TST, top-scoring “N” (TSN) . A remarkable advantage of the TSP family is that they can effectively control experimental system deviations, such as background differences and batch effects between samples. However, TSP, k-TSP, TST, and TSN are only suitable for binary data, and the HC-TSP/HC-TSP calculation process for conversion from multiclass to binary classification is tedious. The gene score  cannot reflect size differences among samples, and k-TSPs may introduce redundancy and undiscriminating voting weights.
Chi-square-statistic-based top scoring genes (TSG) , an improved version of TSP family we proposed before, introduces Chi-square value as the score for each marker set so that the sample size information is fully utilized. TSG proposes a new gene selection method based on joint effects of multiple genes, and the informative genes number is allowed both even and odd. Moreover, TSG gives a new classification method with no demand for training, and it is in a simple unified form for both binary and multiclass cases. In TSG paper, we did not name the classification method alone. Here we called it the chi-square test-based direct classifier (-DC). To predict the class information for each sample in the test data, -DC use the selected marker set and calculate the scores of this sample belonging to each class. The predicted class is set to be the one that has the largest score. Although TSG has many merits, it also has the following disadvantages: (i) for , in order to find the top scoring genes (), all the combined scores between and each of remaining gene need to be calculated. It needs a large amount of calculation; (ii) if there are multiple with identical maximum Chi-square value, TSG should further calculate the LOOCV accuracy of these using the training data and record those that yield the highest LOOCV accuracy. If there is still more than one , the computational complexity will be much higher to find ; (iii) in TSG, an upper bound should be set and find . However, the number of information genes is often less than . The termination condition of feature selection is not objective enough.
Emphasizing interactions between genes or biological marks is a developing trend in cancer classification and informative gene selection. The TSP family, mRMR, doublets , nonlinear integrated selection , binary matrix shuffling filter (BMSF) , and TSG all take interactions into consideration. In genome-wide association studies, ignorance of interactions between SNPs or genes will cause the loss of inheritability . Therefore, we developed a novel high-dimensional feature-selection algorithm called a Chi-square test-based integrated rank gene and direct classifier (-IRG-DC), which inherits the advantages of TSG while overcoming the disadvantages documented above in feature selection. First, this algorithm obtains the weighted integrated rank of gene importance on the basis of chi-square tests of single and pairwise gene interactions. Then, the algorithm sequentially forward introduces ranked genes and removes redundant parts using leave-one-out cross validation (LOOCV) of -DC within the training set to obtain the final informative gene subset of tumor.
A large number of feature-selection methods and classifiers currently exist. Informative gene subsets obtained by different feature-selection methods are very minute overlap . However, different models combined with a certain feature-selection method and a suitable classifier can get a close prediction precision . It is difficult to determine which feature-selection method is better. Therefore, evaluation of the robustness of feature-selection methods deserves more attention . In this paper, we analyzed the robustness of -IRG-DC by comparing the generalization performance of different models, the efficiency of different feature-selection methods, and the precision of different classifiers.
2. Data and Methods
Because nine common binary-class tumor-genomics datasets  did not offer independent test sets, we simply selected ten multiclass tumor-genomics datasets with independent test sets (Table 1) for analysis in this study. It should be noted that the method proposed in this paper could also be applied to binary-class datasets.
2.2. Weighted Integrated Rank of Genes
Assume the training dataset has markers and samples. The data can be denoted as () (). represents the expression value of the th marker in the th sample; represents the label of th sample, where , the set of possible labels; stands for the total number of labels in the data.
Chi-Square Values of Single Genes. For any single gene , denotes the mean expression value of all samples. and represent the frequency counts of samples in class when and , respectively. These frequencies can be presented as an contingency table, as shown in Table 2. Record the frequency counts of samples in class as When equals in class , then both and should be incremented by separately; thus, the chi-square value of gene can be calculated according to (1)
Chi-Square Values of Pairwise Genes. For any two genes and ), and represent the frequency counts of samples in class when and , respectively. and are expression values of the th sample in genes and , respectively. These frequencies can be presented as an × 2 contingency table (Table 3). Record the frequency counts of samples in class as When equals in class , then both and should be incremented by separately. The Chi-square value of pairwise genes can be calculated according to (2)
Rank Genes according to Integrated Weighted Score. Judging whether a gene is important not only should take main effect of gene into account, but also consider the interaction between it and other genes. Therefore, we integrated the Chi-square value of single gene and the Chi-square values of pairwise genes to define an integrated weighted score of each gene as shown in (3). is the integrated weighted score of gene , is the chi-square value of single gene , and is the chi-square value of pairwise genes and . Genes are ranked by the integrated weighted score to become a descending-range sequence. Consider make an ordered list of all the genes in accordance with the descending values of the scores .
2.3. Chi-Square Test-Based Direct Classifier (-DC)
When the training set has samples and labels, with selected genes, there are contingency tables included, each of which has rows and 2 columns (Table 2). If the testing sample belongs to class chi-square values of pairwise genes with samples (i.e., including training samples and a testing sample) can be worked out. The sum of chi-square values was set as . We assign the test sample to the class with the largest chi-square value: class of testing sample .
2.4. Introduce Ranked Genes Sequentially and Remove Redundant Parts to Obtain Informative Genes
Take the top two genes from the ordered list and extract their expression values from the training dataset to form the initial training set. Next, compute the LOOCV accuracy of the initial training data based on -DC and denote it as LOOCV2. Record chi-square values of every sample taken as a measured sample. Finally, introduce parameter , as shown in (4) where is the true label of the measured sample. The average value of every training sample is denoted as .
Now import the third gene from the ordered list and extract its expression values from the training dataset to update the initial training set. Following the steps documented above, obtain LOOCV3 and of the updated training set. If LOOCV3 > LOOCV2, or LOOCV3 = LOOCV2 and , the third gene is selected as an informative gene; Otherwise, it is deemed as a redundant gene.
Similarly, informative gene subsets will be obtained by sequentially introducing the top 2% genes from the ordered list .
2.5. Independent Prediction
With the informative gene subsets, independent prediction based on -DC was conducted individually on the testing sample to obtain the test accuracy.
2.6. Models Used for Comparison
In this paper, a model is considered as a combination of a specific feature-selection method and a specific classifier. Some feature-selection methods are also classifiers (HC-TSP, HC-k-TSP, TSG, DT, PAM, etc.). We selected mRMR-SVM, SVM-RFE-SVM, HC-k-TSP and TSG as comparative models for -IRG-DC; NB, KNN, and SVM as the comparative classifiers of -DC; mRMR, SVM-RFE, HC-k-TSP and TSG as the comparative feature-selection approaches of -IRG-DC.
mRMR conducts minimum redundancy maximum relevance feature selection. Mutual information difference (MID) and mutual information quotient (MIQ) are two versions of mRMR. MIQ was better than MID in general , so the evaluation criterion in this paper is mRMR-MIQ. SVM-RFE is a simple and efficient algorithm which conducts gene selection in a backward elimination procedure. The mRMR and SVM-RFE have been widely applied in analyzing high-dimensional biological data. They only provide a list of ranked genes; a classification algorithm needs to be used to choose the set of variables that minimize cross validation error. In this paper, SVM was selected as the classification algorithm, and our SVM implementation is based on LIBSVM which supports 1-versus-1 multiclass classification. For SVM-RFE-SVM and mRMR-SVM models, informative genes were selected by the following methods: (i) rank the genes separately by mRMR or SVM-RFE; (ii) select the top genes from 1 to , which is equal to approximately 2% of the total gene number, and conduct 10-fold cross-validation (CV10) for the training sets based on SVM. Accuracy was denoted as ; (iii) with the highest CV10 accuracy, the genes were selected as informative genes.
3. Results and Discussion
3.1. Comparison of Independent Test Accuracy and the Number of Informative Genes Used in Different Models
In order to evaluate the performance of model in this study, we used the eight different models to perform independent test on ten multiclass datasets. The test accuracy and informative gene number are presented in Table 4. In this case, the classification accuracy of each dataset is the ratio of the number of the correctly classified samples to the total number of samples in that dataset. The best model based on average accuracy of the ten multiclass datasets used in this study is -IRG-DC (90.81%), followed by TSG (89.2%), PAM (88.5%), SVM-RFE-SVM (86.72%) and HC-k-TSP (85.12%). We do not consider these differences in accuracy as noteworthy and conclude that all five methods perform similarly. However, in terms of efficiency, decision rule and the number of informative genes, one can argue that the -IRG-DC method is superior. Recall that the -IRG-DC, TSG and PAM have easy interpretation and can directly handle multiclass case, but HC-k-TSP and SVM-RFE-SVM need a tedious process to covert multiclass case into binclass case. For the ten multiclass datasets, -IRG-DC selected 37.2 (range, 20–64 in ten datasets) informative genes on average. It clearly uses less number of genes than PAM (1638.8) and TSG (51). Moreover, the algorithm complexities of -IRG-DC is far less than TSG. -IRG-DC ranked all genes according to integrated weighted score firstly and sequentially introduced the ranked genes based on LOOCV accuracy of training data. In fact, -IRG-DC is a hybrid filter-wrapper models that take advantage of the simplicity of the filter approach for initial gene screening and then make use of the wrapper approach to optimize classification accuracy in final gene selection .
|Results reported in .|
3.2. Robustness Analysis—Evaluating Generalization Performance of Different Models
As shown in Table 4, the five models (mRMR-SVM, SVM-RFE-SVM, HC-k-TSP, TSG, and -IRG-DC) exhibited high independent test accuracy and similar informative gene numbers. We further compared the LOOCV accuracy for the training data and the independent test accuracy for the test data from these four models. The results are shown in Figures 1, 2, 3, 4, and 5. Obviously, over-fitting occurred in all five models. Among them, -IRG-DC had higher generalization performance. The test accuracy of mRMR-SVM and SVM-RFE-SVM was no greater than their training accuracy for all ten datasets. However, the test accuracy of -IRG-DC was superior to the training accuracy for the Leuk2, Lung2, and Leuk3 datasets, and the test accuracy of TSG was superior to the training accuracy for the Lung1, Lung2, Leuk2, and Leuk3 datasets. For another direct classifier, HC-k-TSP, the test accuracy was also higher than the training accuracy for the SRBCT and cancers datasets. These results indicated that the special direct classification algorithm of -IRG-DC, TSG and HC-k-TSP can effectively control over-fitting, and exhibiting a better generalization performance.
3.3. Robustness Analysis—Evaluating Different Feature-Selection Methods
As shown in Table 5, with the informative genes selected by the five feature-selection methods, the classification performances of NB and KNN were significantly improved. However, the performance of SVM was improved only with the genes selected by our method, -IRG-DC. This observation indicated, on the one hand, that SVM is not sensitive to feature dimensions , and on the other hand, that -IRG-DC was more robust than the other four feature-selection methods.
|Results reported in ; ‡30 in original paper, whereas the actual number was 70 after validation; †Aver- was the average accuracy of a classifier with informative genes selected by four feature-selection methods.|
With the genes selected by -IRG-DC, four classifiers (NB, KNN, SVM, and -DC) performed very well, with average accuracies of 84.23%, 85.54%, 89.54%, and 90.81%, respectively, across ten datasets; the overall average accuracy was 87.53%. Similarly, we calculated the overall average accuracy of other feature-selection methods: 87.53% (-IRG-DC) > 85.99% (HC-k-TSP) > 84.45% (TSG) > 81.93% (SVM-RFE) > 80.16% (mRMR), once again confirming the robustness and effectiveness of -IRG-DC.
3.4. Robustness Analysis—Comparison of Classifiers
The overall average accuracies of the four classifiers with informative genes selected by five feature-selection methods across ten datasets are highlighted in bold in Table 5. The order is as follows: 85.86% (SVM) > 85.51% (-DC) > 83.42% (NB) > 81.24% (KNN). This result revealed that SVM is an excellent classifier; at the same time, the -DC classifier also performed well.
Informative gene subsets selected by different feature-selection methods often differ greatly. As we can see, genes number selected by the three different models (mRMRSVM, SVM-RFE-SVM) in are listed in Table S1. The numbers of overlapped gene selected by different models are listed in Table S2. Results showed that there are few overlaps of genes selected by the three models (see supplementary Tables S1 and S2 in supplementary materials available online at http://dx.doi.org/10.1155/2014/589290). However, different models combined with a certain feature-selection method and a suitable classifier can get a close prediction precision. Evaluations of robustness of feature-selection methods and classifiers should include the following aspects: (i) models should have good generalization performance, that is, a model should not only have high accuracy in training sets, but should also have high and stable test accuracy across many datasets (average accuracy ± standard deviation); (ii) with informative genes selected by an excellent feature-selection method, should improve varies classifiers performance; (iii) similarly, a good classifier should perform well with different informative genes selected by different excellent feature-selection approaches.
The results of this study illustrate that pairwise interaction is the fundamental type of interaction. Theoretically, the complexity of the algorithm could be controlled within with pairwise interactions. When three or more genes connect to each other, the complex combination of three or more genes could be represented by the pairwise interactions. Based on this assumption, this paper proposes a novel algorithm, -IRG-DC, used for informative gene selection and classification based on chi-square tests of pairwise gene interactions. The proposed method was applied to ten multiclass gene-expression datasets; the independent test accuracy and generalization performance were obviously better than those of mainstream comparative algorithms. The informative genes selected by -IRG-DC were able to significantly improve the independent test accuracy of other classifiers. The average extent of test accuracy raised by -IRG-DC is superior to those of comparable feature-selection algorithms. Meanwhile, informative genes selected by other feature-selection methods also performed well on -DC.
Currently, integrated analysis of multisource heterogeneous data is a key challenge in cancer classification and informative gene selection. This includes the integration of repeated measurements from different assays for the same disease on the same platform , as well as the integration of gene chips, protein mass spectrometry, DNA methylation, and GWAS-SNP data collected on different platforms for the study of the same disease , and so forth. In future, we will apply -IRG-DC to the integrated analysis of multi-source heterogeneous data. Combining this method with the GO database, biological pathways, disease databases, and relevant literature, we will conduct a further assessment of the relevance of the biological functions of selected informative genes to the mechanisms of disease .
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Hongyan Zhang and Lanzhi Li contributed equally to this work. Hongyan Zhang and Lanzhi Li are joint senior authors on this work.
The research was supported by a Grant from the National Natural Science Foundation of China (no. 61300130), the Doctoral Foundation of the Ministry of Education of China (no. 20124320110002), the Postdoctoral Science Foundation of Hunan Province (no. 2012RS4039), and the Science Research Foundation of the National Science and Technology Major Project (no. 2012BAD35B05).
Table S1: The number of genes selected by the different models.
Table S2: Overlaps of genes selected by different models.
- I. Hedenfalk, D. Duggan, Y. D. Chen et al., “Gene-expression profiles in hereditary breast cancer,” New England Journal of Medicine, vol. 344, no. 8, pp. 539–548, 2001.
- V. R. Lyer, M. B. Eisen, D. T. Ross et al., “The transcriptional program in the response of human fibroblasts to serum,” Science, vol. 283, pp. 83–87, 1999.
- X. Jin, A. Xu, R. Bie, and P. Guo, “Machine learning techniques and chi-square feature selection for cancer classification using SAGE gene expression profiles,” in Data Mining for Biomedical Applications, vol. 3916 of Lecture Notes in Computer Science, pp. 106–115, Springer, Berlin, Germany, 2006.
- M. Dash and H. Liu, “Feature selection for classification,” Intelligent Data Analysis, vol. 1, no. 1–4, pp. 131–156, 1997.
- K. Kenji and A. R. Larry, “The feature selection problem: traditional methods and a new algorithm,” in Proceedings of the 10th National Conference on Artificial Intelligence, W. Swartout, Ed., pp. 129–134, AAAI Press/The MIT Press, Cambridge, Mass, USA, 1992.
- T. R. Golub, D. K. Slonim, P. Tamayo et al., “Molecular classification of cancer: class discovery and class prediction by gene expression monitoring,” Science, vol. 286, no. 5439, pp. 531–527, 1999.
- Z. Fang, R. Du, and X. Cui, “Uniform approximation is more appropriate for wilcoxon rank-sum test in gene set analysis,” PLoS ONE, vol. 7, no. 2, Article ID e31505, 2012.
- S. Zhu, D. Wang, K. Yu, T. Li, and Y. Gong, “Feature selection for gene expression using model-based entropy,” IEEE Transactions on Computational Biology and Bioinformatics, vol. 7, no. 1, pp. 25–36, 2010.
- H. Peng, F. Long, and C. Ding, “Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 8, pp. 1226–1238, 2005.
- Y. Wang, I. V. Tetko, M. A. Hall et al., “Gene selection from microarray data for cancer classification—a machine learning approach,” Computational Biology and Chemistry, vol. 29, no. 1, pp. 37–46, 2005.
- M. Han and X. Liu, “Forward feature selection based on approximate Markov blanket,” in Advances in Neural Networks-ISNN 2012, vol. 7368 of Lecture Notes in Computer Science, pp. 64–72, Springer, Berlin, Germany, 2012.
- J. Kittler, “Feature set search algorithms,” in Pattern Recognition and Signal Processing, C. H. Chen, Ed., pp. 41–60, Sijthoff and Noordhoff, Alphen aan den Rijn, The Netherlands, 1978.
- P. Pudil, J. Novovičová, and J. Kittler, “Floating search methods in feature selection,” Pattern Recognition Letters, vol. 15, no. 11, pp. 1119–1125, 1994.
- L.-Y. Chuang, H.-W. Chang, C.-J. Tu, and C.-H. Yang, “Improved binary PSO for feature selection using gene expression data,” Computational Biology and Chemistry, vol. 32, no. 1, pp. 29–38, 2008.
- B. Q. Hu, R. Chen, D. X. Zhang, G. Jiang, and C. Y. Pang, “Ant Colony Optimization Vs Genetic Algorithm to calculate gene order of gene expression level of Alzheimer's disease,” in Proceedings of the IEEE International Conference on Granular Computing (GrC '12), pp. 169–172, Hangzhou, China, August 2012.
- L. J. Cai, L. B. Jiang, and Y. Q. Yi, “Gene selection based on ACO algorithm,” Application Research of Computers, vol. 25, no. 9, pp. 2754–2757, 2008.
- S. Wang, J. Wang, H. Chen, S. Li, and B. Zhang, “Heuristic breadth-first search algorithm for informative gene selection based on gene expression profiles,” Chinese Journal of Computers, vol. 31, no. 4, pp. 636–649, 2008.
- I. Guyon, J. Weston, S. Barnhill, and V. Vapnik, “Gene selection for cancer classification using support vector machines,” Machine Learning, vol. 46, no. 1–3, pp. 389–422, 2002.
- Q. Liu, A. H. Sung, Z. Chen et al., “Gene selection and classification for cancer microarray data based on machine learning and similarity measures,” BMC Genomics, vol. 12, no. 5, article S1, 2011.
- X. Li, S. Peng, J. Chen, B. Lü, H. Zhang, and M. Lai, “SVM-T-RFE: a novel gene selection algorithm for identifying metastasis-related genes in colorectal cancer using gene expression profiles,” Biochemical and Biophysical Research Communications, vol. 419, no. 2, pp. 148–153, 2012.
- K. K. Kandaswamy, K. Chou, T. Martinetz et al., “AFP-Pred: a random forest approach for predicting antifreeze proteins from sequence-derived properties,” Journal of Theoretical Biology, vol. 270, no. 1, pp. 56–62, 2011.
- W. Wei, S. Visweswaran, and G. F. Cooper, “The application of naive Bayes model averaging to predict Alzheimer's disease from genome-wide data,” Journal of the American Medical Informatics Association, vol. 18, no. 4, pp. 370–375, 2011.
- R. M. Parry, W. Jones, T. H. Stokes et al., “K-Nearest neighbor models for microarray gene expression analysis and clinical outcome prediction,” Pharmacogenomics Journal, vol. 10, no. 4, pp. 292–309, 2010.
- T. Mehenni and A. Moussaoui, “Data mining from multiple heterogeneous relational databases using decision tree classification,” Pattern Recognition Letters, vol. 33, no. 13, pp. 1768–1775, 2012.
- T. K. Wu, S. C. Huang, Y. L. Lin, H. Chang, and Y. R. Meng, “On the parallelization and optimization of the genentic-based ANN classifier for the diagnosis of students with learning disabilities,” in Proceedings of the IEEE International Conference on Systems Man and Cybernetics, pp. 4263–4269, Istanbul, Turkey, 2010.
- R. Tibshirani, T. Hastie, B. Narasimhan, and G. Chu, “Diagnosis of multiple cancer types by shrunken centroids of gene expression,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 10, pp. 6567–6572, 2002.
- D. Geman, C. d'Avignon, D. Q. Naiman, and R. L. Winslow, “Classifying gene expression profiles from pairwise mRNA comparisons,” Statistical Applications in Genetics and Molecular Biology, vol. 3, no. 1, 2004.
- A. C. Tan, D. Q. Naiman, L. Xu, R. L. Winslow, and D. Geman, “Simple decision rules for classifying human cancers from gene expression profiles,” Bioinformatics, vol. 21, no. 20, pp. 3896–3904, 2005.
- X. Lin, B. Afsari, L. Marchionni et al., “The ordering of expression among a few genes can provide simple cancer biomarkers and signal BRCA1 mutations,” BMC Bioinformatics, vol. 10, article 256, 2009.
- A. T. Magis and N. D. Price, “The top-scoring “N” algorithm: a generalized relative expression classification method from small numbers of biomolecules,” BMC Bioinformatics, vol. 13, article 227, no. 1, 2012.
- H. Wang, H. Zhang, Z. Dai, M. Chen, and Z. Yuan, “TSG: a new algorithm for binary and multi-class cancer classification and informative genes selection,” BMC Medical Genomics, vol. 6, supplement 1, article S3, 2013.
- P. Chopra, J. Lee, J. Kang, and S. Lee, “Improving cancer classification accuracy using gene pairs,” PLoS ONE, vol. 5, no. 12, Article ID e14305, 2010.
- H. Wang, S.-H. Lo, T. Zheng, and I. Hu, “Interaction-based feature selection and classification for high-dimensional biological data,” Bioinformatics, vol. 28, no. 21, pp. 2834–2842, 2012.
- H. Zhang, H. Wang, Z. Dai, M. S. Chen, and Z. Yuan, “Improving accuracy for cancer classification with a new algorithm for genes selection,” BMC Bioinformatics, vol. 13, article 298, 2012.
- C. Kooperberg, M. LeBlanc, and J. Y. a. Dai, “Structures and assumptions: strategies to harness gene × gene and gene × environment interactions in GWAS,” Statistical Science, vol. 24, no. 4, pp. 472–488, 2009.
- G. Mohana Lakshmi and K. Mythili, “Survey of gene-expression-based cancer subtypes prediction,” International Journal of Advances in Computer Science and Technology, vol. 3, no. 3, pp. 207–211, 2014.
- K.-J. Kim and S.-B. Cho, “Meta-classifiers for high-dimensional, small sample classification for gene expression analysis,” Pattern Analysis and Applications, 2014.
- Y. Leung and Y. Hung, “A multiple-filter-multiple-wrapper approach to gene selection and microarray data classification,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 7, no. 1, pp. 108–117, 2010.
- L. S. Wang, O. U. ZY, and Y. C. Zhu, “Classifying images with SVM method,” Computer Applications and Software, vol. 22, no. 5, pp. 98–102, 2005.
- B. Liquet, K. L. Cao, H. Hocini, and R. Thiébaut, “A novel approach for biomarker selection and the integration of repeated measures experiments from two assays,” BMC Bioinformatics, vol. 13, no. 1, article 325, 2012.
- S. Wu, Y. Xu, Z. Feng, X. Yang, X. Wang, and X. Gao, “Multiple-platform data integration method with application to combined analysis of microarray and proteomic data,” BMC Bioinformatics, vol. 13, no. 1, article 320, 2012.
- A. C. Haury, P. Gestraud, and J. P. Vert, “The influence of feature selection methods on accuracy, stability and interpretability of molecular signatures,” PLoS ONE, vol. 6, no. 12, Article ID e28210, 2011.
- D. G. Beer, S. L. R. Kardia, C. Huang et al., “Gene-expression profiles predict survival of patients with lung adenocarcinoma,” Nature Medicine, vol. 8, no. 8, pp. 816–824, 2002.
- S. A. Armstrong, J. E. Staunton, L. B. Silverman et al., “MLL translocations specify a distinct gene expression profile that distinguishes a unique leukemia,” Nature Genetics, vol. 30, no. 1, pp. 41–47, 2002.
- J. Khan, J. S. Wei, M. Ringnér et al., “Classification and diagnostic prediction of cancers using gene expression profiling and artificial neural networks,” Nature Medicine, vol. 7, no. 6, pp. 673–679, 2001.
- C. M. Perou, T. Sørile, M. B. Eisen et al., “Molecular portraits of human breast tumours,” Nature, vol. 406, no. 6797, pp. 747–752, 2000.
- A. Bhattacharjee, W. G. Richards, J. Staunton et al., “Classification of human lung carcinomas by mRNA expression profiling reveals distinct adenocarcinoma subclasses,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 24, pp. 13790–13795, 2001.
- A. A. Alizadeh, M. B. Eisen, R. E. Davis, C. Ma, and I. S. Lossos, “Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling,” Nature, vol. 403, pp. 503–511, 2000.
- E. J. Yeoh, M. E. Ross, S. A. Shurtleff et al., “Classification, subtype discovery, and prediction of outcome in pediatric acute lymphoblastic leukemia by gene expression profiling,” Cancer Cell, vol. 1, no. 2, pp. 133–143, 2002.
- A. I. Su, J. B. Welsh, L. M. Sapinoso et al., “Molecular classification of human carcinomas by use of gene expression signatures,” Cancer Research, vol. 61, no. 20, pp. 7388–7393, 2001.
- S. Ramaswamy, P. Tamayo, R. Rifkin et al., “Multiclass cancer diagnosis using tumor gene expression signatures,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 26, pp. 15149–15154, 2001.
Copyright © 2014 Hongyan Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.