 Proceedings
 Open Access
 Published:
Molecular cancer classification using a metasamplebased regularized robust coding method
BMC Bioinformatics volume 15, Article number: S2 (2014)
Abstract
Motivation
Previous studies have demonstrated that machine learning based molecular cancer classification using gene expression profiling (GEP) data is promising for the clinic diagnosis and treatment of cancer. Novel classification methods with high efficiency and prediction accuracy are still needed to deal with high dimensionality and small sample size of typical GEP data. Recently the sparse representation (SR) method has been successfully applied to the cancer classification. Nevertheless, its efficiency needs to be improved when analyzing largescale GEP data.
Results
In this paper we present the metasamplebased regularized robust coding classification (MRRCC), a novel effective cancer classification technique that combines the idea of metasamplebased cluster method with regularized robust coding (RRC) method. It assumes that the coding residual and the coding coefficient are respectively independent and identically distributed. Similar to metasamplebased SR classification (MSRC), MRRCC extracts a set of metasamples from the training samples, and then encodes a testing sample as the sparse linear combination of these metasamples. The representation fidelity is measured by the l_{2}norm or l_{1}norm of the coding residual.
Conclusions
Extensive experiments on publicly available GEP datasets demonstrate that the proposed method is more efficient while its prediction accuracy is equivalent to existing MSRCbased methods and better than other stateoftheart dimension reduction based methods.
Introduction
With the advance of DNA microarray and nextgeneration sequencing (NGS) technology [1], a large amount of gene expression profiles (GEP) data has been rapidly accumulated, which requires novel analysis method to deeply mine these big data to interpret such data to gain insight into the mechanism of tumor development. Since Golub et al. made use of gene expression profiling data, obtained using the DNA microarray technology, to classify acute myeloid leukemia (AML) and acute lymphocytic leukemia (ALL) [2], a great number of GEPbased cancer classification methods have been proposed for classifying cancer types or subtypes [3–6]. It has increasingly become clear that common machine learning methods such as support vector machine (SVM) [7, 8] and artificial neural networks (ANN) [5, 9] may not perform very well because of the curse of dimensionality, as the number of features (genes) is usually much higher than the number of samples in most GEP experiments. Therefore, the key task of GEPbased cancer classification should be the design of dimension reduction method to dramatically decrease the number of features in GEP data before constructing classification models.
Dimension reduction methods can be grouped into two categories: feature selection and feature reduction approaches. Feature selection methods [10], such as the heuristic breadthfirst search algorithm, find as many optimal gene subsets as possible and further rank these genes to discover important cancerrelated genes [11]. Feature extraction methods instead employ independent component analysis to model the gene expression data [12, 13]. Gene selection methods do not alter the original representation of each gene, while feature extraction methods, which are based on projection, yield new variables that may reflect the intrinsic characteristics of original features. Other feature extraction methods such as principal component analysis (PCA)[14], linear discriminant analysis (LDA) [15], locally linear discriminant embedding (LLDE) [16], and partial least squares (PLS) [17] are also extensively applied to the dimensionality reduction of GEP. These methods can generally achieve satisfactory classification performance with the minimum dimension reduction. Both feature selection and feature extraction methods have their own advantages and disadvantages. For gene selection methods, their main advantage is that the selected genes may be related to the underlying mechanisms of cancer development. However, different gene selection methods may result in significantly different selected genes and therefore the interpretation of the results can be difficult. For the feature extraction methods, small dimension can be obtained by integrating original features. However, it is difficult to precisely interpret the biomedical meanings of derived features.
Machine learning based methods are also often called modelbased methods because a predictive model is built for predicting the label of test sample. The model selection is a complex training procedure, which easily leads to overfitting and decreased prediction performance. Recently, sparse representation (SR), a powerful data processing method that does not require model selection, has been extensively applied to face recognition [18, 19] and further extended to cancer classification recently [20–22]. For example, Hang, et al. proposed a SRbased classification (SRC) method using {l}_{1}norm minimization to classify cancer test sample. The approach models a classification problem as to find a sparse representations of test samples with respect to training samples [22]. They applied the proposed method to six cancer gene expression datasets and their experimental results demonstrated that the performance of the proposed method was comparable to or better than those of SVMs. Especially, the proposed method does not involve model selection and is robust to noise, outliers and even incomplete measurements. Zheng, et al. further presented a new SRbased method for GEPbased cancer classification, termed metasamplebased SR classification (MSRC), where a set of metasamples are extracted from training samples, and then a testing sample is represented as the linear combination of these metasamples by {l}_{1}regularized least square method [20]. Their experiments on publicly available GEP datasets have shown that MSRC is efficient for cancer classification and can achieve higher accuracy than many existing representative schemes such as SVM, SRC and least absolute shrinkage and selection operator (LASSO) algorithm. In addition, Gan et al. proposed a new classifier, metasamplebased robust sparse representation classifier (MRSRC) based on the MSRC method, for cancer classification [21]. Their experiments show that these methods are efficient and robust.
Previous SRbased model assumes that the coding residual follows Gaussian or Laplacian distribution, which may not be effective for describing the coding residual in practical GEP datasets, and another problem is that the sparsity constraint on coding coefficients leads to the high computational cost of SRC method. To deal with the problem, Yang et al. proposed a new coding model, namely regularized robust coding (RRC) for face recognition [23]. Here, we present a metasamplebased regularized robust coding classification (MRRCC) method, a novel and effective cancer classification technique combining the ideas of metasamplebased and RRC methods. A metasample can be represented as a linear combination of a set of training samples, which may capture the intrinsic structures of these data. The coefficient vector of a metasample may have only a few nonzero elements. The expression patterns over the metasamples can reflect the gene expression patterns. Test samples belonging to the same subclass will have similar sparse representation, while different subclass would result in different sparse representations [22]. Our extensive experiments on cancer datasets show that MRRCC can achieve higher classification accuracy but with lower time complexity, compared with other SRbased methods and dimension reductionbased methods.
Methods
Description of SRbased problem
Let G=\left\{{g}_{1},\cdots \phantom{\rule{0.3em}{0ex}},{g}_{n}\right\} be a set of genes and S=\left\{{s}_{1},\cdots \phantom{\rule{0.3em}{0ex}},{s}_{m}\right\} be a set of samples. \leftG\right=n denotes the number of genes, and \leftS\right=m denotes the number of samples. The corresponding GEP data can be represented as a matrix X={\left({x}_{i,j}\right)}_{nm},1\le i\le n,1\le j\le m, where{x}_{i,j} is the expression level of gene {g}_{i} in sample {s}_{j}. Usually \phantom{\rule{0.25em}{0ex}}n is much bigger than \phantom{\rule{0.25em}{0ex}}m for a typical GEP dataset. Each vector {s}_{i} in the gene expression matrix can be regarded as a point in ndimensional space. Each of the m columns consists of an nelement expression vector for a single sample. Let L=\left\{{c}_{1},\cdots \phantom{\rule{0.3em}{0ex}},{c}_{k}\right\} denote the label set and \leftL\right=k denote the number of subclasses. Because the subclass of each sample is known, S\times L=\left\{\left({s}_{i},{l}_{i}\right){s}_{i}\in {R}^{n},{l}_{i}\in {R}^{n},{l}_{i}\in L,i=1,2,\cdots \phantom{\rule{0.3em}{0ex}},m\right\} denotes the labeled sample space. The whole sample set \phantom{\rule{0.25em}{0ex}}X is randomly split into two disjoint parts: training set \phantom{\rule{0.25em}{0ex}}A and test set \phantom{\rule{0.25em}{0ex}}B. Generally, the SRbased problem could be represented as
where \phantom{\rule{0.25em}{0ex}}y is a given test sample, \phantom{\rule{0.25em}{0ex}}A represents all training samples, \phantom{\rule{0.25em}{0ex}}\alpha is the coding vector of \phantom{\rule{0.25em}{0ex}}y with respect to \phantom{\rule{0.25em}{0ex}}A, and \phantom{\rule{0.25em}{0ex}}\epsilon is a small positive constant. By coding the test sample \phantom{\rule{0.25em}{0ex}}y as a sparse linear combination of the training samples via Eq. (1), SRbased classifier assigns the label to the test sample \phantom{\rule{0.25em}{0ex}}y based on the predictions which subclass can produce the least reconstruction error.
Analysis flowchart of cancer GEP data
The analysis flowchart of the metasamplebased SR method is different from those of traditional modelbased and templatebased methods (Figure 1). The classification models of modelbased methods use the training set to predict the labels of test samples, while templatebased methods create a template for each subclass using training set and then compare a test sample to the templates in order to determine the label of the test sample [3]. Although there is similarity between the analysis flowcharts of metasamplebased SR method and templatebased one, there is a major difference (Figure 1). The reconstructed test samples of the metasamplebased SR method are relevant to not only the training set but also the original test sample, while the templates of templatebased methods are only relevant to the training set. The flowchart of analysis of the metasamplebased SR method includes five steps:

1)
The whole sample set is randomly split into two disjoint parts: training set and test set, and then the metasamples are extracted only from the training set using singular value composition (SVD).

2)
The weight of each gene is calculated according to a weight function, and the genes with lower weight are removed in a test sample {T}_{o} and all metasamples.

3)
The test sample {T}_{o} is represented as a linear combination of all metasamples, and the coding coefficient of the test sample {T}_{o} can be obtained by using RRC.

4)
We can reconstruct the test sample for each subclass by using the metasamples and the coding coefficient of the original test sample {T}_{o}, and the reconstructed test samples (the test sample 1, test sample 2,..., test sample \phantom{\rule{0.25em}{0ex}}k) are denoted by {T}_{1},{T}_{2},\dots ,{T}_{k}, where \phantom{\rule{0.25em}{0ex}}k denotes the number of subclasses in original dataset.

5)
The distance between the processed test sample and each reconstructed test sample {T}_{i},1\le i\le k is calculated, and the original test sample {T}_{o} is assigned to the subclass with minimal distance.
Construct metasamples
The metasample extracted from GEP data is commonly defined as a linear combination of all training samples. In this paper, a set of metasample is extracted from all training samples of one cancer type. We find that metasample can capture the structures to the data and offer biological insight. on the other hand, the linear combination of the metasamples can roughly estimate genetic expression pattern of gene data [24]. Alter, et al. used singular value decomposition (SVD) to transform GEP data from a space of genes \phantom{\rule{0.25em}{0ex}}\times arrays to the diagonal ''eigengenes \phantom{\rule{0.25em}{0ex}}\times eigenarrays'' space [25], where the eigenarrays (or eigengenes) are the unique orthonormal superpositions of the arrays (or genes). In our approach, we can decompose the gene expression data set matrix \phantom{\rule{0.25em}{0ex}}A into two matrices:
where matrix {A}_{i} is of size n\times {m}_{i}, the matrix {M}_{i} is of size n\times {q}_{i} and the matrix {V}_{i} is of size {q}_{i}\times {m}_{i}. Each of {q}_{i} columns in matrix {M}_{i} is defined as a metasample of the \phantom{\rule{0.25em}{0ex}}ith subclass. Each of {m}_{i} columns in matrix {V}_{i} represents the metasample expression pattern of the corresponding samples. D=\left[{M}_{1},\dots {M}_{i},..{M}_{k}\right] denotes the constructed metasample set.
Calculating coding coefficient using RRC
The metasample set D=\left[{M}_{1},\dots {M}_{i},..{M}_{k}\right] can be rewritten as D=\left[{r}_{1};\dots {r}_{i};..{r}_{n}\right], where {r}_{i} denotes the expression level of the \phantom{\rule{0.25em}{0ex}}ith gene in all metasamples. Let y=\left[{y}_{1};\dots {y}_{i};\dots {y}_{n}\right] denote a test sample, where {y}_{i} is the expression level of the \phantom{\rule{0.25em}{0ex}}ith gene. We can consider the cancer classification from the view point of Bayesian estimation, especially the maximum a posterior (MAP) estimation. By using the Bayesian formulation, we can calculate the coding coefficient by the following formula [23]
where {\rho}_{\theta}\left(e\right)=ln{f}_{\theta}\left(e\right) and {\rho}_{o}\left(\alpha \right)=ln{f}_{o}\left(\alpha \right). The coding residual e=yD\alpha =\left[{e}_{1};{e}_{2};\dots ;{e}_{n}\right] are with the probability density function (PDF) {f}_{\theta}\left({e}_{i}\right) and the coding vector \alpha =\left[{\alpha}_{1};{\alpha}_{2};\dots ;{\alpha}_{m}\right] are with PDF{f}_{o}\left({\alpha}_{j}\right). Generally, we assume that the unknown PDF {f}_{\theta}\left(e\right) are symmetric, differentiable and monotonic. Therefore, {\rho}_{\theta}\left(e\right) has following properties: (1) {\rho}_{\theta}\left(0\right)is the global minimal of {\rho}_{\theta}\left(z\right); (2){\rho}_{\theta}\left(z\right)={\rho}_{\theta}\left(z\right); (3) if \left{z}_{1}\right<\left{z}_{2}\right, we can get {\rho}_{\theta}\left({z}_{1}\right)<{\rho}_{\theta}\left({z}_{2}\right). Without loss of generality, we can let {\rho}_{\theta}\left(0\right)=0.
There are two key issues in solving the RRC model. The first one is how to determine the distribution{\rho}_{\theta}. The second one is how to minimize the energy function. The RRC model in Eq. (2) can be approximated as follows.
where \phantom{\rule{0.25em}{0ex}}W is a diagonal matrix.
where {W}_{i,i} is the weight value of each gene. Thus the minimization problem of the RRC model can be transformed into calculating the diagonal weight matrix \phantom{\rule{0.25em}{0ex}}W.
The logistic function has the same properties as the hinge loss function in SVM [26], so we choose it as the weight function.
where \phantom{\rule{0.25em}{0ex}}\mu and \phantom{\rule{0.25em}{0ex}}\delta are two positive constants. Parameter \phantom{\rule{0.25em}{0ex}}\mu controls the decreasing rate from 1 to 0, and \phantom{\rule{0.25em}{0ex}}\delta controls the location of demarcation point. To make {\omega}_{\theta}\left(0\right) close to 1, let the value of \mu \delta be big enough. According to Eq. (4), Eq. (5) and{\rho}_{\theta}\left(0\right)=0, we can get
For cancer classification, the coding coefficients associated with the dictionary atoms from the same subclass would have big absolute values. However, we do not know which subclass the testing sample will belong to. Therefore, we actually assume that the coding coefficient {\alpha}_{j} follows generalized Gaussian distribution (GGD). So we can obtain the following formula.
where \phantom{\rule{0.25em}{0ex}}\Gamma is the gamma function.
The RRC model has two vital cases when \phantom{\rule{0.25em}{0ex}}\beta is set as two specific values [23].
When \beta =1, GGD degenerates to Laplacian distribution, and the RRC model will become
When \beta =2, GGD degenerates to Gaussian distributon, and the RRC model will become
Iteratively reweighted regularized robust coding algorithm
Iteratively reweighted regularized robust coding (IR^{3}C) algorithm was designed by Yang, et al. to solve the RRC model efficiently [23]. The overall procedure of the algorithm is as follows.
Input: Normalized test sample \phantom{\rule{0.25em}{0ex}}y with unit {l}_{2}norm; metasample set \phantom{\rule{0.25em}{0ex}}Dextracted from original training samples; {\alpha}^{\left(1\right)}.
Output: \phantom{\rule{0.25em}{0ex}}\alpha
t=1; // t denotes the iterative times.

1.
Compute the gene residual {e}^{\left(t\right)}=yD{\alpha}^{\left(t\right)}
where {\alpha}^{\left(1\right)}=\left[\frac{1}{m};\frac{1}{m};\dots ;\frac{1}{m}\right], and \mathsf{\text{D}}{\alpha}^{\left(1\right)} is the mean of all metasamples.

2.
Estimate weight value of each gene as
{\omega}_{\theta}\left({e}_{i}^{\left(t\right)}\right)=1/1+\mathsf{\text{exp}}\left(\mu {\left({e}_{i}^{\left(t\right)}\right)}^{2}\mu \delta \right)
where \phantom{\rule{0.25em}{0ex}}\mu and \phantom{\rule{0.25em}{0ex}}\delta would be estimated in each iteration and \phantom{\rule{0.25em}{0ex}}\delta is associated with residual.

3.
Weighted regularized robust coding coefficient:
{\alpha}^{\mathsf{\text{*}}}=\mathsf{\text{arg}}\underset{\alpha}{\mathsf{\text{min}}}\left\{\frac{1}{2}\left\right{\left({W}^{\left(t\right)}\right)}^{0.5}\left(yD\alpha \right){}_{2}^{2}+{\sum}_{j=1}^{m}{\rho}_{o}\left({\alpha}_{j}\right)\right\}; //Assume the {\alpha}_{j} follows generalized Gaussian distribution.

4.
Update the robust coding coefficients.
If t=1, {\alpha}^{\left(t\right)}={\alpha}^{*};
If t>1, {\alpha}^{\left(t\right)}={\alpha}^{\left(t1\right)}+{v}^{\left(t\right)}\left({\alpha}^{*}{\alpha}^{\left(t1\right)}\right); //where 0<{v}^{\left(t\right)}\le 1 is a suitable step size. {v}^{\left(t\right)}could be searched from 1 to 0 by the standard linesearch process [27].

5.
Reconstruct the test sample by coding coefficient and all metasamples
{y}_{rec}^{\left(t\right)}=D{\alpha}^{\left(t\right)}, and let t=t+1.

6.
Return to the step 1 until the condition of convergence \left\right{W}^{\left(t\right)}{W}^{\left(t1\right)}{}_{2}/\left{W}^{\left(t1\right)}\right{}_{2}<\phi (\phantom{\rule{0.25em}{0ex}}\phi is a small positive scalar) is met, or reached the maximal number of iteration.
Algorithm end.
When the algorithm converges, we can use the same classification method as SRC to classify test sample.
where {l}_{d}=\left\right{W}_{final}^{\frac{1}{2}}\left(y{D}_{d}{\hat{\alpha}}_{d}\right){}_{2}, {D}_{d} is the metasample set associated with dth subclass, {\hat{\alpha}}_{d} is the final coding vector associated with dth subclass, and {W}_{final} is the final weight matrix.
When \beta =1, the time complexity of IR^{3}C is O\left(t{m}^{2}n\right), where \phantom{\rule{0.25em}{0ex}}n is the number of genes, \phantom{\rule{0.25em}{0ex}}m is the number of metasamples, and \phantom{\rule{0.25em}{0ex}}t is the iteration times. When \beta =2, the time complexity of IR^{3}C is O\left(t{k}_{1}mn\right), where {k}_{1} is the iteration number in conjugate gradient solution. The time complexity of IR^{3}C with \beta =1 or \beta =2 is much lower complexity than SRC whose time complexity is O\left({m}^{2}{n}^{1.5}\right)[23].
In literature [23] the RRC model with \beta =1 is called as RRC_L1 and the RRC model with \beta =2 is called as RRC_L2. However, in our method the input \phantom{\rule{0.25em}{0ex}}D of IR^{3}C is actually a set of metasamples which are extracted by SVD from the original training set, so we call our methods as MRRCC1 (the metasamplebased regularized robust coding classification 1) and MRRCC2 (the metasamplebased regularized robust coding classification 2) corresponding to the two cases RRC_L1 and RRC_L2, respectively.
Experiments
Cancer datasets
GEP data can be obtained by two technologies, DNA microarray and nextgeneration sequencing (NGS) technologies. In our experiments five microarray and four NGS cancer datasets are used to evaluate the proposed method (Table 1). The five microarray datasets include Diffuse Large Bcell Lymphomas (DLBCL) [28], Acute Lymphoblastic Leukemia (ALL) [29], GCM [30], Lung cancer (Lung) [31], and MLL [32]. The DLBCL dataset contains two subclasses, i.e., DLBCL and Follicular Lymphoma (FL). The ALL dataset totally contains 248 samples that belong to six cancer subtypes: BCRABL, E2APBX1, Hyperdip>50, MLL, TALL and TELAML1. The GCM dataset consists of fourteen different cancer types. The Lung cancer dataset contains four lung cancer types and one normal tissue type (i.e., five subclasses in total). The MLL dataset contains 72 samples from three subtypes or subclasses, i.e., MLL, AML and ALL.
The four NGS datasets are downloaded from the web site: The Cancer Genome Atlas (TCGA) (http://cancergenome.nih.gov/). They include Breast invasive carcinoma (called as BRCACancer), Kidney renal clear cell carcinoma (KIRCCancer), Lung adenocarcinoma (LUADCancer), and Thyroid carcinoma (THCACancer). All samples are matched cancer and normal tissue samples.
Parameter selection
There are two parameters, namely \phantom{\rule{0.25em}{0ex}}\mu and\phantom{\rule{0.25em}{0ex}}\delta, in weight function Eq. (5). We calculate the \phantom{\rule{0.25em}{0ex}}\delta value as follows. Let l=⌊\tau m⌋, where \tau \in \left(0,1\right). Parameter \phantom{\rule{0.25em}{0ex}}\delta can be obtained by the following formula.
where the vector e\in {R}^{n}, {\gamma}_{1}{\left(e\right)}_{q} is the \phantom{\rule{0.25em}{0ex}}qth largest element of the set \left\{{e}_{j}^{2},\mathsf{\text{j}}=1,\dots ,\mathsf{\text{n}}\right\}. Parameter \phantom{\rule{0.25em}{0ex}}\mu is used to control the decreasing rate of the weight {W}_{i,i}. We can simply set \mu =s/\delta, where s=8 is defined as a constant. So the \phantom{\rule{0.25em}{0ex}}\delta value, estimated by \tauaccording to Eq. (11), is a very important parameter to distinguish outlier genes. The selection of parameter \phantom{\rule{0.25em}{0ex}}\tau will be further determined by our experiments.
Figure 2 shows the 10fold cross validation prediction accuracy varying with \phantom{\rule{0.25em}{0ex}}\tau value increasing from 0.1 to 0.9 by 0.1 on four cancer datasets (two microarray datasets and two NGS datasets), from which we can see that the optimal prediction accuracy can be achieved on the four datasets when \phantom{\rule{0.25em}{0ex}}\tauis set to 0.9. So it is appropriate that \phantom{\rule{0.25em}{0ex}}\tauis fixed to 0.9 in our experiments. Furthermore, we find that the prediction accuracy on two microarray datasets is greatly affected by \phantom{\rule{0.25em}{0ex}}\tau values, while the prediction accuracy on two NGS datasets is less affected by \phantom{\rule{0.25em}{0ex}}\tau values, suggesting that the two microarray datasets are noisier than the two NGS datasets.
Comparison with other SRbased methods
The prediction accuracy of the metasamplebased methods is greatly affected by the number of metasamples extracted using SVD. Figure 3 shows the prediction accuracy of the four SRbased methods (MSRC, MRSRC, MRRCC1 and MRCC2) varying with the number of metasamples on four datasets, respectively. And Figure 3 shows that no fixed number of metasamples can consistently achieve the optimal performance of metasamplebased methods. Therefore, the metasamplebased methods require the process of optimizing the number of metasamples. Here twolayer 10fold crossvalidation is used to evaluate the performance of the SRbased methods. The inner layer 10fold crossvalidation is used to determine the optimal number of metasamples for training in outer layer 10fold crossvalidation, and the outer layer 10fold crossvalidation is used to evaluate the classification performance of SRbased methods. The classification accuracy obtained by five SRbased methods on the nine cancer datasets are shown in Table 2. It is clear that our methods MRRCC1 and MRRCC2 are equivalent to other three SRbased methods in optimal prediction accuracy on eight datasets except on GCM dataset.
Comparison with dimension reductionbased methods
A twostage method can be used to reduce the dimensionality of dataset before classification. The first stage is a process of adopting a gene filter method such as KWRST (KruskalWallis rank sum test) [33] or ReliefF [34] to initially select a small set of differentially expressed genes. The second stage is a process of adopting a feature extraction method to further reduce the dimensionality of the dataset. Our previous studies have shown that the predication accuracy of twostage method is influenced by many factors such as normalization method, gene filter method, feature extraction method, classification method, the number of genes selected and the number of features extracted as well as different division of training set and test set, etc. [35]. In our experiments, training sets and test sets are normalized by samples using the zscore normalization method. KWRST is used to filter genes and 300 topranked genes are initially selected. The five feature extraction methods (PCA, LDA, ICA, LLDE, and PLS) are used to reduce the dimensionality of dataset. Knearest neighbor (KNN), one of simplest classification methods, with correlation distance is used to classify cancer samples (here 5 nearest neighbors are used). For LDA method and the datasets with two subclasses, Euclidean distance is used because only one feature is extracted. To avoid overfitting, before classification we extract only 5 features using these feature extraction methods except LDA whose number extracted is K1. We call these methods as PCAKNN, LDAKNN, ICAKNN, LLDEKNN, and PLSKNN, respectively.
Experiments indicate that the different divisions of training sets and test sets can also greatly affect the classification performance. In our experiments, the Balance Division Method (BDM) is used to divide each original dataset into balanced training sets and test sets [4]. For the BDM, \phantom{\rule{0.25em}{0ex}}q samples from each subclass of the original dataset are randomly selected and used as a training set, while the remaining samples are used as test set. Here the limits of \phantom{\rule{0.25em}{0ex}}q value ranges from 5 to \left{c}_{\mathsf{\text{min}}}\right, where {c}_{\mathsf{\text{min}}} denotes the subclass set with minimum number of samples in the original dataset, i.e., \underset{{c}_{i}}{{c}_{\mathsf{\text{min}}}\text{= argmin}}\left(\left{c}_{i}\right\right),\phantom{\rule{2.77695pt}{0ex}}1\le i\le K, where \phantom{\rule{0.25em}{0ex}}k denotes the number of subclass in dataset. We set \phantom{\rule{0.25em}{0ex}}q value to 20 when \left{c}_{\mathsf{\text{min}}}\right>20,. For each \phantom{\rule{0.25em}{0ex}}q value, the statistical mean of prediction accuracies obtained on 100 randomizations of training set and test set are calculated for each method. Figure 4 and Figure 5 show the performance of eight methods varying with different numbers of training samples per subclasses on four microarray datasets and four NGS datasets, respectively. The experimental results indicate that the performance of MRRCC1 and MRRCC2 are almost the same for all but the GCM dataset. Generally, our methods are superior to other five methods in predication accuracy not only on the four microarray datasets but also on the four NGS datasets. On the LUADCancer and THCACancer datasets the performance of our methods is slightly worse than PLSKNN in prediction accuracy when the number of the samples per subclass in training sets is greater than 10.
Conclusions
With the development of microarray and NGS technologies, a huge amount of GEP data is rapidly accumulated, demanding more efficient analysis methods to analyze these data. In this paper we present a novel metasamplebased regularized robust coding for cancer classification (MRRCC) that firstly represents each test sample as a linear combination of all metasamples which are extracted from the original training set using SVD. The coefficient vector is then obtained by {l}_{2}regularized least square that is as powerful as l 1norm regularization but the former has much lower computational cost [23]. The experimental results have demonstrated that MRRCC can achieve higher classification accuracy with lower computational cost than previous stateoftheart solutions such as SRC, MSRC and MRSRC, as well as many dimension reduction based classification methods.
References
Desai AN, Jere A: Nextgeneration sequencing: ready for the clinics?. Clin Genet. 2012, 81 (6): 503510. 10.1111/j.13990004.2012.01865.x.
Golub TR, Slonim DK, Tamayo P, Huard C, Gaasenbeek M, Mesirov JP, Coller H, Loh ML, Downing JR, Caligiuri MA: Molecular classification of cancer: Class discovery and class prediction by gene expression monitoring. Science. 1999, 286 (5439): 531537. 10.1126/science.286.5439.531.
Wang SL, Fang YP, Fang JW: Diagnostic prediction of complex diseases using phaseonly correlation based on virtual sample template. Bmc Bioinformatics. 2013, 14:
Wang SL, Zhu YH, Jia W, Huang DS: Robust Classification Method of Tumor Subtype by Using Correlation Filters. IEEEAcm Transactions on Computational Biology and Bioinformatics. 2012, 9 (2): 580591.
Wang SL, Li XL, Zhang SW, Gui J, Huang DS: Tumor classification by combining PNN classifier ensemble with neighborhood rough set based gene reduction. Computers in Biology and Medicine. 2010, 40 (2): 179189. 10.1016/j.compbiomed.2009.11.014.
Zheng CH, Huang DS, Zhang L, Kong XZ: Tumor clustering using nonnegative matrix factorization with gene selection. IEEE Transactions on Information Technology in Biomedicine. 2009, 13 (4): 599607.
Guyon I, Weston J, Vapnik V: Gene selection for cancer classification using support vector machine. Machine Learning. 2002, 46 (13): 389422.
Furey TS, Cristianini N, Duffy N, Bednarski DW, Schummer M, Haussler D: Support vector machine classification and validation of cancer tissue samples using microarray expression data. Bioinformatics. 2000, 16 (10): 906914. 10.1093/bioinformatics/16.10.906.
Xu Y, Selaru FM, Yin J, Zou TT, Shustova V, Mori Y, Sato F, Liu TC, Olaru A, Wang S: Artificial neural networks and gene filtering distinguish between global gene expression profiles of Barrett's esophagus and esophageal cancer. Cancer Research. 2002, 62 (12): 34933497.
Saeys Y, Inza I, Larranaga P: A review of feature selection techniques in bioinformatics. Bioinformatics. 2007, 23 (19): 25072517. 10.1093/bioinformatics/btm344.
Wang SL, Li XL, Fang JW: Finding minimum gene subsets with heuristic breadthfirst search algorithm for robust tumor classification. Bmc Bioinformatics. 2012, 13:
Huang DS, Zheng CH: Independent component analysisbased penalized discriminant method for tumor classification using gene expression data. Bioinformatics. 2006, 22 (15): 18551862. 10.1093/bioinformatics/btl190.
Zheng CH, Chen Y, Li XX, Li YX, Zhu YP: Tumor classification based on independent component analysis. International Journal of Pattern Recognition and Artificial Intelligence. 2006, 20 (2): 297310. 10.1142/S0218001406004673.
Wang SL, Wang J, Chen HW, Zhang BY: SVMbased tumor classification with gene expression data. Advanced Data Mining and Applications, Proceedings. 2006, 4093: 864870. 10.1007/11811305_94.
Sharma A, Paliwal KK: Cancer classification by gradient LDA technique using microarray gene expression data. Data Knowl Eng. 2008, 66 (2): 338347. 10.1016/j.datak.2008.04.004.
Li B, Zheng CH, Huang DS, Zhang L, Han K: Gene expression data classification using locally linear discriminant embedding. Computers in Biology and Medicine. 2010, 40 (10): 802810. 10.1016/j.compbiomed.2010.08.003.
Nguyen DV, Rocke DM: Tumor classification by partial least squares using microarray gene expression data. Bioinformatics. 2002, 18 (1): 3950. 10.1093/bioinformatics/18.1.39.
Wright J, Yang AY, Ganesh A, Sastry SS, Ma Y: Robust Face Recognition via Sparse Representation. Ieee Transactions on Pattern Analysis and Machine Intelligence. 2009, 31 (2): 210227.
Ma P, Yang D, Ge YX, Zhang XH, Qu Y, Huang S, Lu JW: Robust face recognition via gradientbased sparse representation. J Electron Imaging. 2013, 22 (1):
Zheng CH, Zhang L, Ng TY, Shiu SC, Huang DS: Metasamplebased sparse representation for tumor classification. IEEE/ACM Trans Comput Biol Bioinform. 2011, 8 (5): 12731282.
Gan B, Zheng CH, Liu JX: Metasamplebased robust sparse representation for tumor classification. Engineering. 2013, 5: 7883.
Hang XY, Wu FX: Sparse Representation for Classification of Tumors Using Gene Expression Data. J Biomed Biotechnol. 2009
Yang M, Zhang L, Yang J, Zhang D: Regularized Robust Coding for Face Recognition. Ieee T Image Process. 2013, 22 (5): 17531766.
Liebermeister W: Linear modes of gene expression determined by independent component analysis. Bioinformatics. 2002, 18 (1): 5160. 10.1093/bioinformatics/18.1.51.
Alter O, Brown PO, Botstein D: Singular value decomposition for genomewide expression data processing and modeling. Proceedings of the National Academy of Sciences of the United States of America. 2000, 97 (18): 1010110106. 10.1073/pnas.97.18.10101.
Ramsay J: The elements of statistical learning: Data mining, inference, and prediction. Psychometrika. 2003, 68 (4): 611612. 10.1007/BF02295616.
HiriartUrruty JB, Lemaréchal C: Convex analysis and minimization algorithms. 1996, Berlin; New York: SpringerVerlag, 2
Shipp MA, Ross KN, Tamayo P, Weng AP, Kutok JL, Aguiar RCT, Gaasenbeek M, Angelo M, Reich M, Pinkus GS: Diffuse large Bcell lymphoma outcome prediction by geneexpression profiling and supervised machine learning. Nature Medicine. 2002, 8 (1): 6874. 10.1038/nm010268.
Yeoh EJ RM, 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 (2): 133143. 10.1016/S15356108(02)000326.
Ramaswamy S, Tamayo P, Rifkin R, Mukherjee S, Yeang CH, Angelo M, Ladd C, Reich M, Latulippe E, Mesirov JP: Multiclass cancer diagnosis using tumor gene expression signatures. Proceedings of the National Academy of Sciences of the United States of America. 2001, 98 (26): 1514915154. 10.1073/pnas.211566398.
Bhattacharjee A, Richards WG, Staunton J, Li C, Monti S, Vasa P, Ladd C, Beheshti J, Bueno R, Gillette M: Classification of human lung carcinomas by mRNA expression profiling reveals distinct adenocarcinoma subclasses. Proc Natl Acad Sci USA. 2001, 98 (24): 1379013795. 10.1073/pnas.191502998.
Armstrong SA, Staunton JE, Silverman LB, Pieters R, de Boer ML, Minden MD, Sallan SE, Lander ES, Golub TR, Korsmeyer SJ: MLL translocations specify a distinct gene expression profile that distinguishes a unique leukemia. Nature Genetics. 2002, 30 (1): 4147. 10.1038/ng765.
Kruskal WH, Wallis WA: Use of ranks in onecriterion variance analysis. Journal of the American Statistical Association. 1952, 47 (260): 583621. 10.1080/01621459.1952.10483441.
Kononenko I: Estimating attributes: Analysis and extensions of Relief. European Conference on Machine Learning SpringerVerlag, Catana, Italy. 1994, 171182.
Wang SL, You HZ, Lei YK, Li XL: Performance Comparison of Tumor Classification Based on Linear and Nonlinear Dimensionality Reduction Methods. Advanced Intelligent Computing Theories and Applications. 2010, 6215: 291300. 10.1007/9783642149221_37.
Acknowledgements
This article was funded by the National Science Foundation of China on finding tumorrelated driver pathway with comprehensive analysis method based on nextgeneration sequencing data and the dimension reduction of gene expression data based on heuristic method (grant nos. 61474267, 60973153 and 61133010) and the National Institutes of Health (NIH) Grant P01 AG12993 (PI: E. Michaelis).
This article has been published as part of BMC Bioinformatics Volume 15 Supplement 15, 2014: Proceedings of the 2013 International Conference on Intelligent Computing (ICIC 2013). The full contents of the supplement are available online at http://www.biomedcentral.com/bmcbioinformatics/supplements/15/S15.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
ShuLin Wang designed the framework of analysis, performed the partial experiments, and drafted the manuscript. Liuchao Sun also performed the partial experiments, and Jianwen Fang analyzed the numerical results and revised the manuscript. All authors read and approved the final manuscript.
Rights and permissions
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
About this article
Cite this article
Wang, SL., Sun, L. & Fang, J. Molecular cancer classification using a metasamplebased regularized robust coding method. BMC Bioinformatics 15 (Suppl 15), S2 (2014). https://doi.org/10.1186/1471210515S15S2
Published:
DOI: https://doi.org/10.1186/1471210515S15S2
Keywords
 Singular Value Decomposition
 Feature Extraction Method
 Cancer Dataset
 Cancer Classification
 Generalize Gaussian Distribution