 Research
 Open Access
 Published:
A Partial Least Squares based algorithm for parsimonious variable selection
Algorithms for Molecular Biology volume 6, Article number: 27 (2011)
Abstract
Background
In genomics, a commonly encountered problem is to extract a subset of variables out of a large set of explanatory variables associated with one or several quantitative or qualitative response variables. An example is to identify associations between codonusage and phylogeny based definitions of taxonomic groups at different taxonomic levels. Maximum understandability with the smallest number of selected variables, consistency of the selected variables, as well as variation of model performance on test data, are issues to be addressed for such problems.
Results
We present an algorithm balancing the parsimony and the predictive performance of a model. The algorithm is based on variable selection using reducedrank Partial Least Squares with a regularized elimination. Allowing a marginal decrease in model performance results in a substantial decrease in the number of selected variables. This significantly improves the understandability of the model. Within the approach we have tested and compared three different criteria commonly used in the Partial Least Square modeling paradigm for variable selection; loading weights, regression coefficients and variable importance on projections. The algorithm is applied to a problem of identifying codon variations discriminating different bacterial taxa, which is of particular interest in classifying metagenomics samples. The results are compared with a classical forward selection algorithm, the much used Lasso algorithm as well as Softthreshold Partial Least Squares variable selection.
Conclusions
A regularized elimination algorithm based on Partial Least Squares produces results that increase understandability and consistency and reduces the classification error on test data compared to standard approaches.
Background
With the tremendous increase in data collection techniques in modern biology, it has become possible to sample observations on a huge number of genetic, phenotypic and ecological variables simultaneously. It is now much easier to generate immense sets of raw data than to establish relations and provide their biological interpretation [1–3]. Considering cases of supervised statistical learning, huge sets of measured/collected variables are typically used as explanatory variables, all with a potential impact on some response variable, e.g. a phenotype or class label. In many situations we have to deal with data sets having a large number of variables p in comparison to the number of samples n. In such 'large p small n' situations selection of a smaller number of influencing variables is important for increasing the performance of models, to diminish the curse of dimensionality, to speed up the learning process and for interpretation purposes [4, 5]. Thus, some kind of variable selection procedure is frequently needed to eliminate unrelated features (noise) for providing a more observant analysis of the relationship between a modest number of explanatory variables and the response. Examples include the selection of gene expression markers for diagnostic purposes, selecting SNP markers for explaining phenotype differences, or as in the example presented here, selecting codon preferences discriminating between different bacterial phyla. The latter is particularly relevant to the classification of samples in metagenomic studies [6]. Multivariate approaches like correspondence analysis and principal component analysis has previously been used to analyze variations in codon usage among genes [7]. However, in order to relate the selection specifically to a response vector, like the phylum assignment, we need a selection based on a supervised learning method.
Partial Least Square (PLS) regression is a supervised method specifically established to address the problem of making good predictions in the 'large p small n' situation, see [8]. PLS in its original form has no implementation of variable selection, since the focus of the method is to find the relevant linear subspace of the explanatory variables, not the variables themselves. However, a very large p and small n can spoil the PLS regression results, as demonstrated by Keles et. al.[9], discovering that the asymptotic consistency of the PLS estimators for univariate responses do not hold, and by [10], who observed a large variation on test set.
Boulesteix has theoretically explored a tight connection between PLS dimension reduction and variable selection [11] and work in this field has existed for many years. Examples are [8, 9, 11–23]. For an optimum extraction of a set of variables, we need to look for all possible subsets of variables, which is impossible if p is large enough. Normally a set of variables with a reasonable performance is a compromise over the optimal sub set.
In general, variable selection procedures can be categorized [5] into two main groups: filter methods and wrapper methods. Filter methods select variables as a preprocessing step independently of some classifier or prediction model, while wrapper methods are based on some supervised learning approach [12]. Hence, any PLSbased variable selection is a wrapper method. Wrapper methods need some sort of criterion that relies solely on the characteristics of the data as described by [5, 12]. One candidate among these criteria is the PLS loading weights, where downweighting small PLS loading weights is used for variable selection [8, 11, 13–17, 24–27]. A second possibility is to use the magnitude of the PLS regression coefficients for variable selection [18–20, 28–34]. Jackknifing and/or bootstrapping on regression coefficients has been utilized to select influencing variables [20, 30, 31, 33, 34]. A third commonly used criterion is the Variables Importance on PLS projections (VIP) introduced by Eriksson et. al.[21] and is commonly used in practise [22, 31, 35–37].
There are several PLSbased wrapper selection algorithms, for example uninformative variable elimination (UVEPLS) [18], where artificial random variables are added to the data as a reference such that the variable with least performance are eliminated. Iterative PLS (IPLS) adds new variable(s) in the model or remove variables from the model if it improves the model performance [19]. A backward elimination procedure based on leave one variable out is another example [5]. Although wrapper based methods perform well the number of variables selected is still often large [5, 12, 38], which may make interpretation hard ([23, 39, 40]).
Among recent advancements in PLS methodology itself we find that Indahl et. al.[41] propose a new data compression method for estimating optimal latent variables classification and regression problems by combining PLS methodology and canonical correlation analysis (CCA), called Canonical Powered PLS (CPPLS). In our work we have adopted this new methodology and proposed a regularized greedy algorithm based on a backward elimination procedure. The focus is on classification problems, but the same concept can be used for prediction problems as well. Our principle idea is to focus on a parsimonious selection, achieved by tolerating a minor performance deviation from any 'optimum' if this gives a substantial decrease in the number of selected variables. This is implemented as a regularization of the search for optimum performance, making the selection less dependent on 'peak performance' and hence more stable. In this respect, the choice of the CPPLS variant is not important, and even the use of nonPLS based methods could in principle be implemented with some minor adjustments. Both loading weights, PLS regression coefficients significance obtained from jackknifing and VIP are explored here for ordering the variables with respect to their importance.
1 Methods
1.1 Model fitting
We consider a classification problem where every object belongs to one out of two possible classes, as indicated by the n × 1 class label vector C. From C we create the n × 1 numeric response vector y by dummy coding, i.e. y contains only 0's and 1's. The association between y and the n × p predictor matrix X is assumed to be explained by the linear model E(y) = X β where β are the p × 1 vector of regression coefficients. The purpose of variable selection is to find a column subset of X capable of satisfactory explaining the variations in C.
From a modeling perspective, ordinary least square fitting is no option when n < p. PLS resolves this by searching for a small set of components, 'latent vectors', that performs a simultaneous decomposition of X and y with the constraint that these components explain as much as possible of the covariance between X and y.
1.2 Canonical Powered PLS (CPPLS) Regression
PLS is an iterative procedure where relation between X and y is found through the latent variables. The PLS estimate of the regression coefficients for the above given model based on k components can be achieved by
where ${\widehat{P}}_{1}$ is the p_{l} × k matrix of Xloadings that is summary of Xvariables, ${\widehat{p}}_{2}$ is the a vector of yloadings i.e. summary of yvariables and $\widehat{W}$ is the p × k matrix of loading weights, for details see [8]. Recently, Indahl et. al.[41] proposed a new data compression method for estimating optimal latent variables by combining PLS methodology and canonical correlation analysis (CCA). They introduce a flexible tradeoff between the element wise correlations and variances specified by a power parameter γ, ranging from 0 to 1. Defines the loading weights as
where s_{ k }denotes the sign of the k^{th}correlation and K_{ γ }is a scaling constant assuring unit length w(γ). In this study we restricted γ to lower region (0.001, 0.050) and to upper region (0.950, 0.999). This means we consider combinations of γ for emphasizing either the variance (γ close to 0) or the correlations (γ close to 1). The γ value from above regions that optimizes the canonical correlation is always selected for each component of CPPLS algorithm, see Indahl et. al.[41] for details on the CPPLS algorithm.
Based on the CPPLS estimated regression coefficients $\widehat{\beta}$ we can predict the dummyvariables by
and from the data set $\left(\widehat{y},C\right)$ we build a classifier using straightforward linear discriminant analysis [42].
1.3 First regularization  model dimension estimate
The CPPLS algorithm assumes that the column space of X has a subspace of dimension α containing all information relevant for predicting y(known as the relevant subspace) [43]. In order to estimate α we use crossvalidation and the performance P_{ a }defined as the fraction of correctly classified observations in a crossvalidation procedure, using a components in the CPPLS algorithm.
The crossvalidation estimate of α can be found by systematically trying out a range of dimensions a = 1,..., A, compute P_{ a }for each a, and choose as $\widehat{\alpha}$ the a where we reach the maximum P_{ a }. Let us denote this value a*. It is well known that in many cases P_{ a }will be almost equally large for many choices of a. Thus, estimating α by this maximum value is likely to be a rather unstable estimator. To stabilize this estimate we use a regularization based on the principle of parsimony where we search for the smallest possible a whose corresponding performance is not significantly worse than the optimum. If ρ_{ a }is the probability of a correct classification using the acomponent model, and ρ_{a*}similar for the a*component model, we test H_{0} : ρ_{ a }= ρ_{a*}against the alternative H_{1} : ρ_{ a }< ρ_{a*}. In practice P_{ a }and P_{a*}are estimates of ρ_{ a }and ρ_{a*}. The smallest a where we cannot reject H_{0} is our estimate $\widehat{\alpha}$. The testing is done by analyzing the 2 × 2 contingency table of correct and incorrect classifications for the two choices of a, using the McNemar test [44]. This test is appropriate since the model classification at a specific component depends on the model classification at the other components.
This regularization depends on a userdefined rejection level c of the McNemar test. Using a large c (close to 1) means we easily reject H_{0}, and the estimate $\widehat{\alpha}$ is often similar to a*. By choosing a smaller c (closer to 0) we get a harder regularization, i.e. a smaller $\widehat{\alpha}$ and more stability at the cost of a lower performance.
1.4 Selection criteria
We have implemented and tried out three different criteria for PLSbased variable selection:
1.4.1 Loading weights
Variable j can be eliminated if the relative loading weight, r_{ j }for a given PLS component satisfies ${r}_{j}=\left\frac{{w}_{a,j}}{max{w}_{a}}\right<u$ for some chosen threshold u ∈ [0, 1].
1.4.2 Regression coefficients
Variable j can be eliminated if the corresponding regression coefficient β_{ j }= 0. Testing H_{0} : β_{ j }= 0 against H_{1}: β_{ j }≠ = 0 can be done by a jackknife ttest. All computations needed have already been done in the crossvalidation used for estimating the model dimension α. For each variable we compute the corresponding false discovery rate (q value) which is based on the p values from jackknifing, and variable j can be eliminated if q_{ j }> u for some fixed threshold u ∈ [0, 1].
1.4.3 Variable importance on PLS projections (VIP)
VIP for the variable j is defined according to [21] as
where a = 1, 2, ..., a*, w_{ aj }is the loading weight for variable j using a components and t_{ a }, w_{ a }and p_{2a}are CPPLS scores, loading weights and yloadings respectively corresponding to the a^{th}component. [22] explains the main difference between the regression coefficient β_{ j }and v_{ j }. The v_{ j }weights the contribution of each variable according to the variance explained by each PLS component, i.e. ${p}_{2a}^{2}{t}_{a}^{\prime}{t}_{a}$ where (w_{ aj }/w_{ a })^{2} represents the importance of the j^{th}variable. Variable j can be eliminated if v_{ j }< u for some userdefined threshold u ∈ [0, ∞). It is generally accepted that a variable should be selected if v_{ j }> 1, see [21, 22, 36], but a proper threshold between 0.83 and 1.21 can maximize the performance [36].
1.5 Backward elimination
When we have n << p it is very difficult to find the truly influencing variables since the estimated relevant subspace found by CrossValidated CPPLS (CVCPPLS) is bound to be, to some degree, 'infested' by noninfluencing variables. This may easily lead to errors both ways, i.e. both false positives and false negatives. An approach to improve on this is to implement a stepwise estimation where we gradually eliminate 'the worst' variables in a greedy algorithm.
The algorithm can be sketched as follows: Let Z_{0} = X and let s_{ j }be one of the criteria for variable j we have sketched above (either r_{ j }, q_{ j }or v_{ j }).

1)
For iteration g run y and Z _{ g }through CVCPPLS. The matrix Z _{ g }has p _{ g }columns, and we get the same number of criterion values, sorted in ascending order as ${s}_{\left(1\right)},...,{s}_{\left({p}_{g}\right)}$.

2)
There are M criterion values below (above for citerion q _{ j }) the cutoff u. If M = 0, terminate the algorithm here.

3)
Else, let N = ⌈fM⌉ for some fraction f ∈ 〈0,1]. Eliminate the variables corresponding to the N most extreme criterion values.

4)
If there are still more than one variable left, let Z _{g+1}contain these variables, and return to 1).
The fraction f determines the 'steplength' of the elimination algorithm, where an f close to 0 will only eliminate a few variables in every iteration. The fraction f and u can be obtained through cross validation.
1.6 Second regularization  final selection
In each iteration of the elimination the CVCPPLS algorithm computes the crossvalidated performance, and we denote this with P_{ g }for iteration g. After each iteration, the number of influencing variables decreases, but P_{ g }will often increase until some optimum is achieved, and then drop again as we keep on eliminating. The initial elimination of variables stabilizes the estimates of the relevant subspace in the CVCPPLS algorithm, and hence we get an increase in performance. Then, if the elimination is too severe, we start to lose informative variables, and even if stability is increased even more, the performance drops.
Let the optimal performance be defined as
It is not unreasonable to use the variables still present after iteration g* as the final selected variables. This is where we have achieved a balance between removing noise and keeping informative variables. However, frequently we observe that a severe reduction in the number variables compared to this 'optimum' will give only a modest drop in performance. Hence, we may eliminate well beyond g*, and find a much simpler model, at a small loss in performance. To formalize this, we use exactly the same procedure, involving the McNemar test that we used in the regularization of the model dimension estimate. If ρ_{ g }is the probability of a correct classification after g iterations, and ρ_{g*}similar after g* iterations, we test H_{0} : ρ_{ g }= ρ_{g*}against the alternative H_{1} : ρ_{ g }< ρ_{g*}. The largest g where we cannot reject H_{0} is the iteration where we find our final selected variables. This means we need another rejection level d which will decide to which degree we are willing to sacrifice performance over a simpler model. Using d close to 0 means we emphasize simplicity over performance. In practice, for each iteration beyond g* we can compute the McNemar test p value, and list this together with the number of variables remaining, to give a perspective on the tradeoff between understandability of the model and the performance. Figure 1 presents the procedure in a flow chart.
1.7 Choices of variable selection methods for comparison
Three variable selection methods are also considered for comparison purposes. The classical forward selection procedure (Forward) is a univariate approach, and probably the simplest approach to variable selection for the 'large p small n' type of problems considered here. The Least Absolute Shrinkage and Selection Operator (Lasso) [45] is a method frequently used in genomics. Recent examples are the extraction of molecular signatures [46] and gene selection from microarrays [47]. The SoftThresholding PLS (STPLS) [17] implements the Lasso concept in a PLS framework. A recent application of STPLS is the mapping of genotype to phenotype information [48].
All methods are implemented in the R computing environment http://www.rproject.org/.
2 Application
An application of the variable selection procedure is to find the preferred codons associated with certain prokaryotic phyla.
Codons are triplets of nucleotides in coding genes and the messenger RNA; these triplets are recognized by basepairing by corresponding anticodons on specific transfer RNA carrying individual amino acids. This facilitates the translation of genetic messenger information into specific proteins. In the standard genetic code, the 20 amino acids are individually coded by 1, 2, 4 or 6 different codons (excluding the three stop codons there are 61 codons). However, the different codons encoding individual amino acids are not selectively equivalent because the corresponding tRNAs differ in abundance, allowing for selection on codon usage. Codon preference is considered as an indicator of the force shaping genome evolution in prokaryotes [49, 50], reflection of life style [49] and organisms within similar ecological environments often have similar codon usage pattern in their genomes [50, 51]. Higher order codon frequencies, e.g. dicodons, are considered important with respect to joint effects, like synergistic effect, of codons [52].
There are many suggested procedures to analyze codon usage bias, for example the codon adaptation index [53], the frequency of optimal codons [54] and the effective number of codons [55]. In the current study, we are not specifically looking at codon bias, but how the overall usage of codons can be used to distinguish prokaryote phyla. Notice that the overall codon usage is affected both by the selection of amino acids and codon bias within the redundant amino acids. Phylum is a relevant taxonomic level for metagenomic studies [56, 57], so interest lies in having a systematic search for codon usage at the phylum level [58–60].
2.1 Data
Genome sequences for 445 prokaryote genomes and the respective Phylum information were obtained from NCBI Genome Projects (http://www.ncbi.nlm.nih.gov/genomes/lproks.cgi). The response variable in our data set is phylum, i.e. the highest level taxonomic classifier of each genome, in the bacterial kingdom. There are in total 11 several phyla in our data set including Actinobacteria, Bacteroides, Crenarchaeota, Cyanobacteria, Euryarchaeota, Firmicutes, Alphaproteobacteria, Betaproteobacteria, Deltaproteobacteria, Gammaproteobacteria and Epsilonproteobacteria. We only consider twoclass problems, i.e. for some fixed 'phylum A', we only classify genomes as either 'phylum A', or 'not phylum A'. Thus, the data set has n = 445 samples and 11 different responses of 0/1 outcome, considering one at a time.
Genes for each genome were predicted by the genefinding software Prodigal [61], which uses dynamic programming in which start codon usage, ribosomal site motif usage and GC frame bias are considered for gene prediction. For each genome, we collected the frequencies of each codon and each dicodon over all genes. The predictor variables thus consists of relative frequencies for all codons and dicodons, giving a predictor matrix X with a total of p = 64 + 64^{2} = 4160 variables (columns).
2.2 Parameter setting/tuning
It is in principle no problem to eliminate (almost) all variables, since we always go back to the iteration where we cannot reject the nullhypothesis of the McNemar test. Hence, we fixed u at extreme values, 0.99 for loading weights, 0.01 for regression coefficients and 10 for VIP. Three levels of step length f = (0.1,0.5, 1) were considered. In the first regularization step we tried three very different rejection levels c = (0.1,0.5, 1) and in the second we used two extreme levels (d = (0.01,0.99)).
2.3 The split of data into test and training
Figure 2 gives a graphical overview of the data splitting used in this study. The split is carried out at three levels. At level 1 we split the data into a test set containing 25% of the genomes and a training set containing the remaining 75%. This was repeated 100 times, i.e. 100 pairs of test and training sets were constructed by random drawing with replacement. Test and training set were never allowed to overlap. In each of the 100 instances, the training data were used by each of the four methods listed to the right. They select variables, and the selected variables were used for classifying the level 1 test set, and performance was computed for each method.
Inside our suggested method, the stepwise elimination, there are two levels of crossvalidation as indicated by the right part of the figure. First, a 10fold crossvalidation was used to optimize the fraction f and the rejection level d in the elimination part of our algorithm. At level 3 leaveoneout crossvalidation was used to estimate all parameters in the regularized CPPLS method, including the rejection level c. These two levels together corresponds to a 'crossmodel validation' [62].
3 Results and Discussions
For identification of codon variations that distinguishes different bacterial taxa to be utilized as classifiers in metagenomic analysis, 11 models, representing each phylum, were considered separately. We have chosen the phylum Actinobacteria for a detailed illustration of the method, while results for all phyla are provided below. In Figure 3 we illustrate how the elimination process affects model performance (P) reflecting the percentage of correctly classified samples, starting at the left with the full model and iterating to the right by eliminating variables. Use of any of the three criteria loading weights, regression coefficient significance or VIP, produces the same type of behavior. A fluctuation in performance over iterations is typical, reflecting the noise in the data. At each iteration, we only eliminate a fraction (1% in many cases) of the poor ranking variables, giving the remaining variables a chance to increase the performance at later iterations. We do not stop at the maximum performance, which may occur almost anywhere due to the noise, but keep on eliminating until we reach the minimum model not significantly worse than the best. This may lead to a substantial decrease in the number of variables selected.
In the upper panels of Figure 4, a comparison of the number of variables selected by the 'optimum' model and our selected model is displayed. A crosscomparison of the criteria loading weights, regression coefficient and VIP based elimination procedure is also made. Xiaobo et. al.[23] has criticized the wrapper procedures for being unable to extract a small number of variables, which is important for interpretation purposes [23, 39]. This is reflected here as none of the 'optimum' model selections (lower boxes) resulted in a small number of selected variables. However, using our regularized algorithm (upper boxes) we are able to select a small number of variables in all cases. The VIP based elimination performs best in this respect (upper right panel), but the other criteria are also competing well. The variance in model size is also very small for our regularized algorithm compared to the selection based on 'optimum' performance.
Comparison of the number of variables selected by Forward, Lasso and STPLS is made in the lower panels of Figure 4. All three methods end up with a small number of selected variables on the average, but STPLS has a large variation in the number of selected variables.
The classification performances in the test and training data sets are examined in Figure 5. In the left panels we show the results for our procedure using the criteria loading weights, regression coefficient and VIP during selection. In general all three criteria behave equally well. As expected, the best performance is found in the training data for the 'optimum' model. Also, performance is consistently worse in the test data compared to the training data for all cases, but this pattern is most clearly present for the 'optimum' model. This may be seen as an indication of overfitting. A huge variation in test data performance can be observed for the full model, and slightly smaller for the 'optimum' model. Our selected models give somewhat worse overall training performance, but evaluated on the test sets they come out at the same level as the 'optimum' model, and with a much smaller variance.
In the right hand panels, performance is shown for the three alternative methods. Our algorithm comes out with at least as good performance on the test sets as any of the three alternative methods. Particularly notably is the larger variation in test performance for the alternative methods compared to the selected models in the left panels. A formal testing by the MannWhitney test [63] indicates that our suggested procedure with VIP outperforms Lasso (p < 0.001), Forward (p < 0.001) and STPLS (p < 0.001) on the data sets used in this study. The same was also true if we used loading weights or regression coefficient as ranking criteria.
When we are interested in the interpretation of the variables, it is imperative that the procedure we use shows some stability with respect to which variables are being selected. To examine this we introduce a selectivity score. If a variable is selected as one out of m variables, it will get a score of 1/m. Repeating the selection 100 times for the same variables, but with slightly different data, we add up the scores for each variable and divide by 100. Thus, a variable having a large selectivity score is often selected as one among a few variables. A procedure that selects almost all variables, or completely new variables, each time, will produce very similar and small selectivity scores for all variables. Conversely, a procedure that home in on the same few variables in each case, will produce some very big selectivity scores on these variables. In Figure 6 we show the selectivity scores sorted in descending order for the three criteria loading weights, regression coefficients and VIP, and for the alternative methods Forward, Lasso and STPLS selection. This indicates that VIP is the most stable criterion, giving the largest selectivity scores, but loading weights and regression coefficient performs almost as good. The Lasso method is as stable as our proposed method using the VIP criterion, while Forward and STPLS seems worse as they spread the selectivity score over many more variables. From the definition of VIP we know that the importance of the variables is downweighted as number of CPPLS components increases. This probably reduces the noise influence and thus provides more stable and consistent selection, also observed by [22].
95% of our selected model uses 1 component while the rest uses 2 components. It is clear from the definition of Loading weights, VIP and regression coefficients that the sorted index of variables based on these measures will be the same for 1 component. This could be the reason for the rather similar behavior of loading weights, VIP and regression coefficient in above analysis.
In order to get a rough idea of the 'nulldistribution' of this selectivity score, we ran the selection on data where the response y was permuted at random. From this the upper 0.1% percentile of the nulldistribution is determined, which is approximately corresponds to the selectivity score above 0.01. For each phylum and variables giving a selectivity score above this percentile are listed in Table 1. The selected variables will also have positive or negative impact depending on the sign of the regression coefficients as indicated in the table. A dicodon with a positive/negative regression coefficient is informative because it occurs more/less frequently in this phylum than in the entire population. It appears that, the larger phyla are in general more difficult to classify, simply because there are more diversity inside the group. On the other hand, the results obtained for the larger phyla are more relevant. Because a larger set of genomes usually means less sampling bias, i.e. the data set represents the phylum better. Interestingly, all of the selected variables are dicodons (no single codons), providing additional support for that the interaction of codons are highly important for explaining variations in phyla [49, 52, 64]. It should be noted that the performance listed for each phylum in Table 1 is an optimistic estimate of the real performance we must expect on a new data set, since it is based on variables selected by maximizing performance over all data in the present data set. However, for comparisons between phyla they are still relevant.
4 Conclusion
We have suggested a regularized backward elimination algorithm for variable selection using Partial Least Squares, where the focus is to obtain a hard, and at the same time stable, selection of variables. In our proposed procedure, we compared three PLSbased selection criteria, and all produced good results with respect to size of selected model, model performance and selection stability, with a slight overall improvement for the VIP criterion. We obtained a huge reduction in the number of selected variables compared to using the models with optimum performance based on training. The apparent loss in performance compared to the optimum based models, as judged by the fit to the training set, is virtually disappearing when evaluated on a separate test set. Our selected model performs at least as good as three alternative methods, Forward, Lasso and STPLS, on the present test data. This also indicates that the regularized algorithm not only obtain models with superior interpretation potential, but also an improved stability with respect to classification of new samples. A method like this could have many potential uses in genomics, but more comprehensive testing is needed to establish the full potential. This proof of principle study should be extended by multiclass classification problems as well as regression problems before a final conclusion can be drawn. From the data set used here we find a smallish number of dicodons associated with various bacterial phyla, which is motivated by the recognition of bacterial phyla in metagenomics studies. However, any type of genomewide association study may potentially benefit from the use of a multivariate selection method like this.
References
 1.
Bachvarov B, Kirilov K, Ivanov I: Codon usage in prokaryotes. Biotechnology and Biotechnological Equipment. 2008, 22 (2): 669
 2.
Binnewies T, Motro Y, Hallin P, Lund O, Dunn D, La T, Hampson D, Bellgard M, Wassenaar T, Ussery D: Ten years of bacterial genome sequencing: comparativegenomicsbased discoveries. Functional & integrative genomics. 2006, 6 (3): 165185. 10.1007/s1014200600272
 3.
Shendure J, Porreca G, Reppas N, Lin X, McCutcheon J, Rosenbaum A, Wang M, Zhang K, Mitra R, Church G: Accurate multiplex polony sequencing of an evolved bacterial genome. Science. 2005, 309 (5741): 1728 10.1126/science.1117389
 4.
Hastie T, Tibshirani R, Friedman J: The Elements of Statistical Learning. 2008
 5.
Fernández Pierna J, Abbas O, Baeten V, Dardenne P: A Backward Variable Selection method for PLS regression (BVSPLS). Analytica chimica acta. 2009, 642 (12): 8993. 10.1016/j.aca.2008.12.002
 6.
Riaz K, Elmerich C, Moreira D, Raffoux A, Dessaux Y, Faure D: A metagenomic analysis of soil bacteria extends the diversity of quorumquenching lactonases. Environmental Microbiology. 2008, 10 (3): 560570. 10.1111/j.14622920.2007.01475.x
 7.
Suzuki H, Brown C, Forney L, Top E: Comparison of correspondence analysis methods for synonymous codon usage in bacteria. DNA Research. 2008, 15 (6): 357 10.1093/dnares/dsn028
 8.
Martens H, Næs T: Multivariate Calibration. 1989, Wiley
 9.
Keleş S, Chun H: Comments on: Augmenting the bootstrap to analyze high dimensional genomic data. TEST. 2008, 17: 3639. 10.1007/s117490080104z
 10.
Höskuldsson A: Variable and subset selection in PLS regression. Chemometrics and Intelligent Laboratory Systems. 2001, 55 (12): 2338. 10.1016/S01697439(00)001131
 11.
Boulesteix A, Strimmer K: Partial least squares: a versatile tool for the analysis of highdimensional genomic data. Briefings in Bioinformatics. 2007, 8: 32
 12.
John G, Kohavi R, Pfleger K: Irrelevant features and the subset selection problem. Proceedings of the eleventh international conference on machine learning. 1994, 129: 121129. Citeseer
 13.
JouanRimbaud D, Walczak B, Massart D, Last I, Prebble K: Comparison of multivariate methods based on latent vectors and methods based on wavelength selection for the analysis of nearinfrared spectroscopic data. Analytica Chimica Acta. 1995, 304 (3): 285295. 10.1016/00032670(94)00590I
 14.
Alsberg B, Kell D, Goodacre R: Variable selection in discriminant partial leastsquares analysis. Anal Chem. 1998, 70 (19): 41264133. 10.1021/ac980506o
 15.
Trygg J, Wold S: Orthogonal projections to latent structures (OPLS). Journal of Chemometrics. 2002, 16 (3): 119128. 10.1002/cem.695
 16.
Boulesteix A: PLS dimension reduction for classification with microarray data. Statistical Applications in Genetics and Molecular Biology. 2004, 3: 1075
 17.
Sæbø S, Almøy T, Aarøe J, Aastveit AH: STPLS: a multidimensional nearest shrunken centroid type classifier via PLS. Jornal of Chemometrics. 2007, 20: 5462.
 18.
Centner V, Massart D, de Noord O, de Jong S, Vandeginste B, Sterna C: Elimination of uninformative variables for multivariate calibration. Anal Chem. 1996, 68 (21): 38513858. 10.1021/ac960321m
 19.
Osborne S, Künnemeyer R, Jordan R: Method of wavelength selection for partial least squares. The Analyst. 1997, 122 (12): 15311537. 10.1039/a703235h
 20.
Cai W, Li Y, Shao X: A variable selection method based on uninformative variable elimination for multivariate calibration of nearinfrared spectra. Chemometrics and Intelligent Laboratory Systems. 2008, 90 (2): 188194. 10.1016/j.chemolab.2007.10.001
 21.
Eriksson L, Johansson E, KettanehWold N, Wold S: Multiand megavariate data analysis. 2001, Umetrics Umeå
 22.
Gosselin R, Rodrigue D, Duchesne C: A BootstrapVIP approach for selecting wavelength intervals in spectral imaging applications. Chemometrics and Intelligent Laboratory Systems. 2010, 100: 1221. 10.1016/j.chemolab.2009.09.005
 23.
Xiaobo Z, Jiewen Z, Povey M, Holmes M, Hanpin M: Variables selection methods in nearinfrared spectroscopy. Analytica chimica acta. 2010, 667 (12): 1432. 10.1016/j.aca.2010.03.048
 24.
Frank I: Intermediate least squares regression method. Chemometrics and Intelligent Laboratory Systems. 1987, 1 (3): 233242. 10.1016/01697439(87)800679
 25.
KettanehWold N, MacGregor J, Dayal B, Wold S: Multivariate design of process experiments (MDOPE). Chemometrics and Intelligent Laboratory Systems. 1994, 23: 3950. 10.1016/01697439(93)E0072C
 26.
Lindgren F, Geladi P, Rännar S, Wold S: Interactive variable selection (IVS) for PLS. Part 1: Theory and algorithms. Journal of Chemometrics. 1994, 8 (5): 349363. 10.1002/cem.1180080505
 27.
Liu F, He Y, Wang L: Determination of effective wavelengths for discrimination of fruit vinegars using near infrared spectroscopy and multivariate analysis. Analytica chimica acta. 2008, 615: 1017. 10.1016/j.aca.2008.03.030
 28.
Frenich A, JouanRimbaud D, Massart D, Kuttatharmmakul S, Galera M, Vidal J: Wavelength selection method for multicomponent spectrophotometric determinations using partial least squares. The Analyst. 1995, 120 (12): 27872792. 10.1039/an9952002787
 29.
Spiegelman C, McShane M, Goetz M, Motamedi M, Yue Q, Cot'e G: Theoretical justification of wavelength selection in PLS calibration: development of a new algorithm. Anal Chem. 1998, 70: 3544. 10.1021/ac9705733
 30.
Martens H, Martens M: Multivariate Analysis of QualityAn Introduction. 2001, Wiley
 31.
Lazraq A, Cleroux R, Gauchi J: Selecting both latent and explanatory variables in the PLS1 regression model. Chemometrics and Intelligent Laboratory Systems. 2003, 66 (2): 117126. 10.1016/S01697439(03)000273
 32.
Huang X, Pan W, Park S, Han X, Miller L, Hall J: Modeling the relationship between LVAD support time and gene expression changes in the human heart by penalized partial least squares. Bioinformatics. 2004, 4991
 33.
Ferreira A, Alves T, Menezes J: Monitoring complex media fermentations with nearinfrared spectroscopy: Comparison of different variable selection methods. Biotechnology and bioengineering. 2005, 91 (4): 474481. 10.1002/bit.20526
 34.
Xu H, Liu Z, Cai W, Shao X: A wavelength selection method based on randomization test for nearinfrared spectral analysis. Chemometrics and Intelligent Laboratory Systems. 2009, 97 (2): 189193. 10.1016/j.chemolab.2009.04.006
 35.
Olah M, Bologa C, Oprea T: An automated PLS search for biologically relevant QSAR descriptors. Journal of computeraided molecular design. 2004, 18 (7): 437449. 10.1007/s1082200440608
 36.
Chong G, Jun CH: Performance of some variable selection methods when multicollinearity is present. Chemometrics and Intelligent Laboratory Systems. 2005, 78: 103112. 10.1016/j.chemolab.2004.12.011
 37.
ElMasry G, Wang N, Vigneault C, Qiao J, ElSayed A: Early detection of apple bruises on different background colors using hyperspectral imaging. LWTFood Science and Technology. 2008, 41 (2): 337345. 10.1016/j.lwt.2007.02.022
 38.
Aha D, Bankert R: A comparative evaluation of sequential feature selection algorithms. 1996, SpringerVerlag, New York
 39.
Ye S, Wang D, Min S: Successive projections algorithm combined with uninformative variable elimination for spectral variable selection. Chemometrics and Intelligent Laboratory Systems. 2008, 91 (2): 194199. 10.1016/j.chemolab.2007.11.005
 40.
Ramadan Z, Song X, Hopke P, Johnson M, Scow K: Variable selection in classification of environmental soil samples for partial least square and neural network models. Analytica chimica acta. 2001, 446 (12): 231242. 10.1016/S00032670(01)009990
 41.
Indahl U, Liland K, Næs T: Canonical partial least squares: A unified PLS approach to classification and regression problems. Journal of Chemometrics. 2009, 23 (9): 495504. 10.1002/cem.1243
 42.
Ripley B: Pattern recognition and neural networks. 2008, Cambridge Univ Pr
 43.
Naes T, Helland I: Relevant components in regression. Scandinavian journal of statistics. 1993, 20 (3): 239250.
 44.
Agresti A: Categorical data analysis. 2002, 359: John Wiley and Sons
 45.
Tibshirani R: Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society. Series B (Methodological). 1996, 267288.
 46.
Haury A, Gestraud P, Vert J: The influence of feature selection methods on accuracy, stability and interpretability of molecular signatures. Arxiv preprint arXiv:1101.5008. 2011
 47.
Lai D, Yang X, Wu G, Liu Y, Nardini C: Inference of gene networks application to Bifidobacterium. Bioinformatics. 2011, 27 (2): 232 10.1093/bioinformatics/btq629
 48.
Mehmood T, Martens H, Saebo S, Warringer J, Snipen L: Mining for GenotypePhenotype Relations in Saccharomyces using Partial Least Squares. BMC bioinformatics. 2011, 12: 318 10.1186/1471210512318
 49.
Hanes A, Raymer M, Doom T, Krane D: A Comparision of Codon Usage Trends in Prokaryotes. 2009 Ohio Collaborative Conference on Bioinformatics. 2009, 8386. IEEE
 50.
Chen R, Yan H, Zhao K, Martinac B, Liu G: Comprehensive analysis of prokaryotic mechanosensation genes: Their characteristics in codon usage. Mitochondrial DNA. 2007, 18 (4): 269278.
 51.
Zavala A, Naya H, Romero H, Musto H: Trends in codon and amino acid usage in Thermotoga maritima. Journal of molecular evolution. 2002, 54 (5): 563568. 10.1007/s002390010040y
 52.
Nguyen M, Ma J, Fogel G, Rajapakse J: Dicodon usage for gene classification. Pattern Recognition in Bioinformatics. 2009, 211221.
 53.
Sharp P, Li W: The codon adaptation indexa measure of directional synonymous codon usage bias, and its potential applications. Nucleic acids research. 1987, 15 (3): 1281 10.1093/nar/15.3.1281
 54.
Ikemura T: Correlation between the abundance of Escherichia coli transfer RNAs and the occurrence of the respective codons in its protein genes: A proposal for a synonymous codon choice that is optimal for the E. coli translational system* 1. Journal of molecular biology. 1981, 151 (3): 389409. 10.1016/00222836(81)900036
 55.
Wright F: The effective number of codons' used in a gene. Gene. 1990, 87: 2329. 10.1016/03781119(90)904919
 56.
Petrosino J, Highlander S, Luna R, Gibbs R, Versalovic J: Metagenomic pyrosequencing and microbial identification. Clinical chemistry. 2009, 55 (5): 856 10.1373/clinchem.2008.107565
 57.
Riesenfeld C, Schloss P, Handelsman J: Metagenomics: genomic analysis of microbial communities. Annu Rev Genet. 2004, 38: 525552. 10.1146/annurev.genet.38.072902.091216
 58.
Ellis J, Griffin H, Morrison D, Johnson A: Analysis of dinucleotide frequency and codon usage in the phylum Apicomplexa. Gene. 1993, 126 (2): 163170. 10.1016/03781119(93)903638
 59.
Lightfield J, Fram N, Ely B, Otto M: Across Bacterial Phyla, DistantlyRelated Genomes with Similar Genomic GC Content Have Similar Patterns of Amino Acid Usage. PloS one. 2011, 6 (3): e17677 10.1371/journal.pone.0017677
 60.
Kotamarti M, Raiford D, Dunham M: A Data Mining Approach to Predicting Phylum using GenomeWide Sequence Data.
 61.
Hyatt D, Chen GL, Locascio PF, Land ML, Larimer FW, Hauser LJ: Prodigal: prokaryotic gene recognition and translation initiation site identification. BMC Bioinformatics. 2010, 11: 119 10.1186/1471210511119
 62.
Anderssen E, Dyrstad K, Westad F, Martens H: Reducing overoptimism in variable selection by crossmodel validation. Chemometrics and intelligent laboratory systems. 2006, 84 (12): 6974. 10.1016/j.chemolab.2006.04.021
 63.
Wolfe D, Hollander M: Nonparametric statistical methods. Nonparametric statistical methods. 1973
 64.
Newman J, Ghaemmaghami S, Ihmels J, Breslow D, Noble M, DeRisi J, Weissman J: Singlecell proteomic analysis of S. cerevisiae reveals the architecture of biological noise. Nature. 2006, 441 (7095): 840846. 10.1038/nature04785
Acknowledgements
Tahir Mehmoods scholarship has been fully financed by the Higher Education Commission of Pakistan, Jonas Warringer was supported by grants from the Royal Swedish Academy of Sciences and Carl Trygger Foundation.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors' contributions
TM and LS initiated the project and the ideas. All authors have been involved in the later development of the approach and the final algorithm. TM has done the programming, with some assistance from SS and LS. TM and LS has drafted the manuscript, with inputs from all other authors. All authors have read and approved the final manuscript.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
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/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Mehmood, T., Martens, H., Sæbø, S. et al. A Partial Least Squares based algorithm for parsimonious variable selection. Algorithms Mol Biol 6, 27 (2011). https://doi.org/10.1186/17487188627
Received:
Accepted:
Published:
Keywords
 Partial Least Square
 Variable Selection
 Codon Usage
 Lasso
 Canonical Correlation Analysis