 Methodology article
 Open Access
 Published:
Classification based on extensions of LSPLS using logistic regression: application to clinical and multiple genomic data
BMC Bioinformatics volume 19, Article number: 314 (2018)
Abstract
Background
To address highdimensional genomic data, most of the proposed prediction methods make use of genomic data alone without considering clinical data, which are often available and known to have predictive value. Recent studies suggest that combining clinical and genomic information may improve predictions. We consider here methods for classification purposes that simultaneously use both types of variables but apply dimensionality reduction only to the highdimensional genomic ones.
Results
Using partial least squares (PLS), we propose some onestep approaches based on three extensions of the least squares (LS)PLS method for logistic regression. A comparison of their prediction performances via a simulation and on real data sets from cancer studies is conducted.
Conclusion
In general, those methods using only clinical data or only genomic data perform poorly. The advantage of using LSPLS methods for classification and their performances are shown and then used to analyze clinical and genomic data. The corresponding prediction results are encouraging and stable regardless of the data set and/or number of selected features. These extensions have been implemented in the R package lsplsGlm to enhance their use.
Background
Over the past 15 years, progress in the generation of highdimensional genomic data has raised high expectations in biomedical research. Largescale technologies have produced a wide variety of genomic features, such as mRNAgene expression, DNA methylation, microRNA, and copy number alterations (CNAs), among others. Many genomic data of these types have been generated and analyzed in numerous studies with the aim of predicting a specific outcome [1, 2]. In this article, we focus on binary class prediction where the outcome can be for instance alive/dead, or therapeutic success/failure. Most of these studies [3–7] include clinical data in addition to genomic data, using most of the proposed prediction methods with only genomic data, which involves some statistical issues. In genomic studies, the number of samples n is often relatively small compared to the number of covariates p, and collinearity between measurements occurs. Unless a preliminary step of variable selection is performed, the standard classification methods are not appropriate. To address this “large p small n” problem, variable selection or dimensionality reduction methods or a combination of both can be used. We focus here only on those dimensionality reduction methods that aim at summarizing the numerous predictors in the form of a small number of new components (often linear combinations of the original predictors). The traditional approach is principal component regression (PCR)[8], an application of principal component analysis (PCA) to the regression model. PCA is applied without considering the link between the outcome and the independent variables. An alternative method is the partial least square (PLS) method [9], which takes this link into account.
In recent studies [10–12], most complex diseases have been shown to be caused by the combined effects of many diverse factors, including genomic and clinical variables. This has led to an emerging research area of integrative studies of clinical and genomic data, which we will refer to as clinicogenomic models. Some strategies to combine these two kinds of data have been reviewed in a paper written by [13] to adress predictive clinicogenomic models. More extensive overviews are available in [14], where advantages and disadvantages are given for each strategy. Regarding the dimensionality reduction strategy, one possible way to handle the high dimensionality of genomic data is to first apply dimensionality reduction techniques to only the genomic data set. In the second step, the selected genomic variables are merged with the clinical variables to build a classification model on the combined data set. We refer to this as a twostep approach. Most previous techniques select the topmost discriminative genomic features and then combine those features into a combined score for future model development. In the same way, [15] suggest an approach combining PLS dimensionality reduction with a prevalidation technique and random forests, applied with both the new components and the clinical variables as predictors. These papers mainly describe methods using PLS dimensionality reduction to treat highdimensional data. Even if any type of dimensionality reduction method can be incorporated, these twostep approaches cannot account for the relationship existing between two data sets. Indeed, this reduction is achieved without considering into account the link between the response variable and the clinical data.
An alternative approach could be to use an iterative procedure well suited to extracting relevant information from the genomic data in combination with clinical variables. One idea is to use the principle of backfitting procedures developed in the context of multidimensional regression problems and derived for generalized additive models [16], estimating additive components successively in a nonparametric manner. Specifically, this involves repeatedly fitting nonparametric regression of some partial residuals on each covariate. For each regression, a new additive component is estimated, which in turn yields new partial residuals; this process is iterated until convergence. Then, updates based on relevant information from both data types takes place within the iterations. This one step approach was developed by [17] in the regression Gaussian context for chemometrics. Nonparametric regression is replaced with PLS regression for the data to be compressed and ordinary least squares (OLS) regression for other data, socalled LSPLS. The PLS scores are thus incorporated into the OLS equations in an iterative fashion to obtain a model for both the clinical variables and the genomic ones. The authors conclude that the method seems to involve more information from the experiment and return lower variance in the parameter estimates.
The purpose of this paper is thus to adapt this onestep LSPLS procedure to logistic regression models. To carry this out, we first need to extend PLS in this context. Some studies proposing an adaptation of PLS for classification problems have been published [18–20]. In this paper, we focus on adapting these extensions to LSPLS to address the logistic regression model. The method section gives the details of the original LSPLS approach corresponding to Gaussian linear regression, that corresponding to linear logistic regression and three novel extensions of LSPLS for logistic regression models. The simulation study conducted to evaluate these approaches, and a demonstration on two real data sets containing both clinical information and multiple genomic data types (gene expression and CNA) are presented in the results section.
Results
Simulation study
The aim of the simulation study is to compare the different prediction methods developed based on clinical and/or gene expression variables. We simulated data sets with a range of predictor collinearity and with different functional relationships between the response, Y_{i}, and the predictors X_{i·} and D_{i·} to mimic gene expression and clinical variable data. For an individual i=1,...,n, with n=100, we simulated \( {Y}_{i} \sim \mathcal {B}({\pi _{i}})\) with \(\pi _{i}=\left [1\; {\mathbf {D}}_{i\cdot }^{T} \;{\mathbf {X}}_{i\cdot }^{T}\right ]{\boldsymbol {\gamma }}\), where γ, the vector of regression parameters, defined as γ=[γ_{1} γDT γXT]^{T}. We fixed γ_{1}=−2.5, γ_{D}={{0.5}^{4}} and γ_{X}={{0}^{475},{0}^{475},{0.1}^{25},{0.1}^{25}}. The matrix X of size n×p (with p=1000) has been simulated as X=(X^{1},X^{2},X^{3},X^{4}), where \({\mathbf {X}}^{k} \sim N\left (0_{bs^{(k)}},{\boldsymbol {\Sigma }}_{{\mathbf {X}}}^{k}\right)\) with {ΣXk}_{ij}=c_{k}ρ^{i−j}, k=1,...,4, i,j=1,...,bs^{(k)}, where c_{1}=8, c_{2}=4, c_{3}=2, and c_{4}=1, bs^{(1)}=bs^{(2)}=475, bs^{(3)}=bs^{(4)}=25, and ρ=0.9. Regarding the matrix D of size n x q (with q=4), we used N(0_{q},Σ_{D}) with {Σ_{D}}_{ij}=ρ^{i−j}, with i, j=1,...,q and ρ=0.5. According to this model, we generated 100 training sets of size n=100 and 100 test sets of size 450. Note that the context of this simulation is unfavorable for LSPCR. Indeed, since the variable blocks that are not active in the model possess the strongest variability, they stand out from among the first κ components of the PCA.
Our proposed extensions, i.e., LSPLSIRLS, IRLSPLS, and RLSPLS, are then applied to the simulated data sets. To compare the accuracy and efficiency of the latter, the GLM is applied to clinical data alone, and RPLS is applied to gene expression data alone. The usual method based on PCR is also considered. In our context, gene expression data are replaced with the first κ principal components of X (obtained by PCA), which constitute the directions of maximal variability in the data of X, without considering the response variable Y. Let T be the matrix of columns, that correspond to the first κ PCA scores associated with X. The parameters are then estimated by running IRLS (Y,[D T]). This approach is called least squares principal component regression (LSPCR). For all approaches, the optimal number of PLS or PCR components is selected by choosing κ values in the range of 1,...,κ_{max}, with κ_{max}=1, 4 and 8, by a fivefold crossvalidation on each of the 100 training sets. That is, each training set is split fivefold into a test set, containing onefifth of the data, and a learning set, containing the remaining fourfifths of the data. We retain the value of κ, which minimizes the misclassification rate over this fivefold crossvalidation. This is also employed for RLSPLS, where the κ value and λ for 6 log_{10}−linearly spaced points in the range [10^{−3};100] are simultaneously determined by this crossvalidation method.
As referenced in [15], although variable selection is not always necessary as a preliminary step to PLSbased classification, some authors argue that accuracy is improved in the highdimensional setting, especially when indeed few relevant variables exist. Many variable selection procedures are available in the literature. In the present article, sure independence screening (SIS) [21] is performed to select relevant gene expression variables p_{red}=500 such that p_{red} is strictly smaller than p. The SIS procedure involves ranking features according to marginal utility, namely, each feature is used independently as a predictor to determine its usefulness for predicting the response. Specifically, the SIS procedure ranks the importance of features according to their magnitude of marginal regression coefficients.
To evaluate prediction performance, mean misclassification rates and the area under the curve (AUC) are computed on the 100 test sets for each method. The rates of convergence are also assessed for LSPCR and those methods based on the PLS algorithm. Simulations and analyses are performed using the R software, version 3.1.2.
The simulation results are summarized in Fig. 1 and Table 1, which were produced based on the 100 simulated data sets. They depict the distributions of misclassification rates, AUCs and convergence rates in percent. For this simulation study, the two classes are much less distinguishable by the clinical data than by the gene expression data, which is confirmed in Fig. 1. Analyses of the clinical features alone by the GLM and genomic data alone using RPLS are less informative in predicting the outcome than those of the approaches combining both types of variables. All approaches integrating clinical and genomic data, except LSPCR, show comparable discrimination rates. The method using PCR increases the misclassification rates and decreases the AUC as κ_{max} decreases. Quite surprisingly, even with κ_{max}=4 or 8, LSPCR does not achieve the performance of the LSPLS approaches. According to the model structure, we would expect LSPCR to identify the two active components and thus to yield similar results. For each case of κ_{max}, RLSPLS seems to be better than the two other extensions of PLS (LSPLSIRLS and IRLSPLS), even though the median misclassification rates of RLSPLS and IRLSPLS are very similar to each other. The analysis of the variance of misclassification error rates follows the same trend as previously described, i.e., the misclassification error rate. RLSPLS leads to less variability than the other methods. The same behavior is also observed in the resulting convergence rates reported in Table 1. RLSPLS does not show convergence problems (all rates equal 100%). The convergence rate of LSPLSIRLS is much lower than that of RLSPLS, probably due to numerical instability of the methods when n is smaller than the number of variables. Notably, the interpretation of the convergence rate of IRLSPLS is seriously limited by the lack of an optimum criterion in the approach. One explanation could be that when solving the weighted LS problem in each IRLS iteration with LSPLS, the global problem cannot be rewritten as the optimization of a loss function.
Note that the noninfluential variables having the highest variances may seem unrealistic since the influential gene expression variables can have higher variances than the noninfluential ones in practice. To make the simulation results more robust with respect to a potential bias towards an overoptimistic performance of our approaches, we have chosen to attribute a stronger variability to the noninfluential variables. We have thus reconsidered the same simulation example but inverted the variances levels. Surprisingly, we obtain similar results; the LSPCR method leads to poorer performance even if κ_{max} is equal to 8 (see Additional file 1).
Application to real data sets
We apply the extensions presented previously to two publicly available real data sets for which both clinical and genomic variables are available. Similar to the simulation study, to validate procedures of the clinicogenomic models, we compare the combined clinicogenomic model accuracy and AUC with those of the models built either with genomic data or clinical data alone. We apply and compare all the methods considered in the simulation study. On both real data sets, we perform a rerandomization study on 100 random subdivisions of the data set into a learning set and a test set. For the first one, we choose a test set size equal to onethird the data (2:1 scheme of [22]); considering the size of the second data set, a ratio of 30 (learning set) to 70 (test set) has been used. The SIS procedure is applied to genomic data, as in the simulation study, considering different numbers of selected genes p_{red}: 50, 100, 500 and 750. For the real data, the κ range is {1,2,...,5} and the λ range is given by 6 log10linearly spaced points in the range [10^{−3};100].
Gene expression : central nervous system data
The first data set was obtained from [23], which has been used to predict the response of childhood malignant embryonal tumors of the central nervous system (CNS) to therapy. The data set is composed of 60 patient samples, with 21 patients having died and 39 having survived within a period of 24 months; gene expression data and clinical data are available for each patient. There are 7129 genes, and the clinical features are sex (binary), age (ordinal), chemo CX (binary) and chemo VP (binary). The original data set contains the clinical variable change stage, which has been omitted due to its large number of categories.
Figure 2 depicts the mean misclassification rates according to the number of selected genes p_{red} obtained for the analysis of the CNS data. This data set presents a situation in which, gene expression data alone (RPLS) performed better than clinical data alone (GLM), with the lowest misclassification rates regardless of the value of p_{red} (0.35 for GLM and approximatively 0.17 for RPLS). Except for LSPCR, the proposed procedures integrating clinical and genetic features perform well with corresponding misclassification rates ranging from 0.16 to 0.20. These findings are not influenced by the number of significant gene expression variables. However, the misclassification rate from LSPCR increases as p_{red} grows. We consider that the information necessary to correctly predict the response could be concentrated in only a set of 50 genes. As provided, overall, the prediction performances of RPLS are close to those achieved using the newly proposed LSPLS approaches. The accuracy of the prediction approaches for the CNS using only 500 selected genes is detailed in Fig. 3. As already noted, the performance in relation to the clinical data when predicting the response is poor. The RLSPLS method attains the highest median accuracy, close to the median misclassification rate achieved when analyzing only gene expression data via PLS (RPLS). The prediction results of LSPLSIRLS and IRLSPLS are very similar and better than those of RLSPLS. We note the large variability of the misclassification rates for all proposed LSPLS methods. For this study, the worst predictions are obtained using the LSPCR method, indicating the poor performance of PCR in treating information stored in highdimensional data. Plots similar to those in Fig. 3, corresponding to the three other values of p_{red} are given in Additional file 2.
Copy number alterations: breast cancer data
The second original data set [10, 24] contains information on 2173 primary breast tumors, integrating somatic CNAs and longterm clinical followup data. Different types of data are merged based on the sample IDs. The data of a total of 1349 primary breast tumors (684 from patients with ERpositive (ER+) status and 221 with ERnegative (ER) status) are given, including the clinical variables (grade (nominal), tumor stage (ordinal), human epidermal growth factor receptor 2 (HER2) status (binary), tumor size (numeric), progesterone receptor status (binary)) and CNA measurements. The goal here is to predict the ER stratification of a novel breast tumor to select the appropriate treatment for breast cancer. Concerning somatic CNAs, the data set used in this paper is prepared as described in the original manuscript [24], yielding 22544 somatic mutations. The data were downloaded from the TCGA data portal (https://tcgadata.nci.nih.gov/).
We report in Fig. 4, the mean misclassification rates obtained for the most pertinent covariates from the SIS procedure p_{red} for all methods. Here, we have the case where the use of clinical data alone or genomic data alone does not offer good predictors of ER stratification. Indeed, we observe a major gain in misclassification rates when the response variable is predicted using either the LSPLS or LSPCR approaches regardless of the value of p_{red}. More specifically, the rates decrease to values between p_{red}=50 and p_{red}=500 and no longer change. The optimal misclassification rate is close to 0.13 with p_{red}=500. Figure 5 shows a boxplot of the misclassification rates and the AUCs for p_{red}=500. The analysis of the CNA data improves only the prediction accuracy yielded by the clinical variables alone. The median misclassification rate obtained using RPLS is smaller than that obtained via the GLM. The four methods combining clinical and genomic data provide similar and significantly better misclassification rates and AUCs compared to those of both the GLM and RPLS. These findings suggest that CNA data perform slightly better than clinical data, though the integration of both features is more effective in predicting the response. Plots similar to those in Fig. 5, corresponding to the three other values of p_{red}, are given in Additional file 3.
Discussion
The three extensions of the LSPLS and PCRtype approaches have been implemented in the R package lsplsGlm. A clinicogenomic model that can predict a binary outcome using dimensionality reduction methods would be a useful computing tool for integrating clinical and gene expression data. In general, the methods using only clinical data or only genomic data perform less well.
We show that it is not always advisable to use the PCRtype method, which can lead to suboptimal results that depend on the data type and the number of selected features and therefore the relation between the response variable and the covariate structure. Indeed, in PCR, the principal components that are dropped correspond to the nearcollinearities among the genetic data. PCR does not consider the response variable when determining which principal components to drop. Although crossvalidation has been used to select the optimal number of components, this decision is based mainly on the magnitude of the variance of the components since in PCA, the dependence on the response variable is weak when compared to PLS. The LSPLS extensions have been shown to be capable of simultaneously analyzing both clinical and genetic data. We also demonstrated that the LSPLS methods have several advantages over other approaches. The corresponding prediction results are quite accurate and stable regardless of the data set and/or the number of selected features, which is not the case for LSPCR. Concerning the comparison among the three LSPLS extensions, we first mention the convergence problems for the LSPLSIRLS and IRLSPLS methods. We note that for the LSPLSIRLS method, the convergence problem can be linked to the GLM algorithm, whereas for the RLSPLS method, it is related to the algorithm itself.
In practice, dependencies frequently occur between clinical and gene expression data, which is why the question of the additional predictive value of gene expression data to clinical data plays an important role in the literature [12, 25]. When clinical or gene expression covariates are considered separately, wellperforming prediction rules can be achieved, but additional value can be obtained by considering the gene expression when the clinical covariates are still present in the model. Therefore, it seems interesting to consider settings in which correlations exist between the clinical data and the gene expression data. From a conceptual point of view, the three methods have the same approach regarding the issue of collinearity present among clinical and genomic data. Indeed, for the three approaches, the matrix of gene expressions is orthogonalized on that of the clinical data, which is not the case in the PCR approach. In Additional file 4, we consider examples with D and X to be generated such that some of the variables among these two data sets are correlated. We have varied these correlations and studied the behaviors of the different methods. We observe that RLSPLS always does better regardless of the collinearity level. The other two extensions of LSPLS are much more variable and are less satisfactory on average, although they tend to improve as the collinearity level increases. We believe that this outcome is due to the convergence problem of these two LSPLS extensions.
Regarding the comparison with the twostep approaches, the results obtained from the LSPLS approaches presented here are different from the findings of [15], where data are analyzed using a twostep approach based on random forests (RF) and PLS reduction. Our approaches were applied to the breast cancer gene expression data (results not shown here) considered in [15]. In this study, the best rate of misclassification was 0.2269 on average, while the worst was 0.2981. In the study in [15], regarding methods based on PLS, the best rate of misclassification was 0.30 on average, while the worst was 0.43. Hence, the onestep approach using the two data sets simultaneously seems better than the twostep approach using the two data sets separately.
A study by [26] on an extension of Integrative mixture of experts (ME) models for combining clinical and gene markers to improve cancer prognosis has been published. They illustrate the performance of the methodology on three cancer studies and, particularly, on CNS data sets. Even if the study using integrative ME cannot be considered as a dimensionality reduction approach, the authors first assess the classification performance on each separate data set, as in our study. Then, they compare the integrative ME with the logistic regression and PLSRF of [15] on the combined data sets. Using three different preselection variable steps, an evaluation in which was varied p_{red} between 5 and 30 was performed. They show the important role of the gene selection step in the predictive ability of these models. Compared with our findings, regardless of the variable selection step, the average error rates obtained using the integrative ME approach are higher than those obtained using the extensions of LPPLS for logistic regression with p_{red}=50. When the data sets are combined and with 30 genes preselected, the average classification error rates obtained via the integrative ME approaches are greater than 30%, while they are less than 20% for LPPLS extensions.
Determining the appropriate number of genomic features in the first step is difficult. The number of features may impact the comparison between the additive performances corresponding to clinical and genomic variables. For example, if too many features are selected from genomic data, the clinicogenomic model may be overfit in the second phase. On the other hand, if too few genomic factors are retained, then the predictive capability of the genomic factor can be underestimated. We may conclude that the model’s performance was not improved by the addition of large numbers of genes but was improved by the interplay of significant clinical features and genomic profiles.
This work constitutes a first step towards the extension of LSPLS. In the present study, we consider only the case of LSPLS for classification problems. Due to the large number of studies modeling survival using gene expression [27, 28], another natural extension of this work is to use LSPLS approach to generate survival prediction models. The outcome would be a rightcensored timetoevent such as the time to death or the time to next relapse, and Cox regression models must be considered.
Recently, some sparse versions of PLS have been proposed for highdimensional classification problems in genome biology [29–31]. They aim to achieve variable selection and dimensionality reduction simultaneously for one type of data and they show that the combination of both increases the prediction performance and selection accuracy. This suggests that a subsequent extension of PLS could be carried out to achieve a “sparse” version of LSPLS in the challenging task of combining both clinical and genomic factors.
Conclusion
Despite the great potential of clinicogenomic integration, the topic is still in its elaboration phase. In general, integrating heterogeneous data sets such as clinical and genomic data is an important issue. We have proposed three extensions of LSPLS approaches for logistic regression models to analyze both clinical and genomic data. The advantage of using those methods for classification and their performances are shown and then used to analyze clinical and genomic data. The corresponding prediction results are encouraging and stable regardless of the data set and/or number of selected features. These extensions have been implemented in the R package lsplsGlm to enhance their use.
Methods
Original LSPLS approach
In the following, we consider situations where we have both partly collinear measurements, such as highdimensional genomic data, and orthogonal (or nearorthogonal) design variables on one side that we want to relate to a response value on the other side. We denote the design matrix associated with the collinear measurements as X. For instances, in genomic samples, expression levels of the p genes for the n genomic samples are collected in this n×p data matrix X. The clinical variables are stored in matrix D of size n×q.
The combination of least squares (LS) and PLS (called LSPLS) was first introduced in the Gaussian context by [17]. LSPLS involves an iterative procedure: the first step is to use OLS on \(\tilde {{\mathbf {D}}}\) to predict Y and compute the residuals. The matrix \(\tilde {{\mathbf {D}}}\) is defined as \(\tilde {{\mathbf {D}}} = \left [1_{n} \; {\mathbf {D}}\right ]\), with 1_{n}=(1,⋯,1)^{T}. Then, PLS is performed between X and the residuals to obtain the matrix of PLS scores T (of size n×κ). T is combined with \(\tilde {{\mathbf {D}}}\) in a new OLS regression to predict Y. New estimates for the residuals of Y on \(\tilde {{\mathbf {D}}}\) are obtained, keeping only the residuals associated with \(\tilde {{\mathbf {D}}}\) in the OLS of Y on \([\tilde {{\mathbf {D}}}, {\mathbf {T}}]\). This algorithm is repeated until convergence. The authors suggest orthogonalizing X on \(\tilde {{\mathbf {D}}}\). The orthogonalized variant is better suited for situations where the focus is on identifying the unique information in each matrix. The matrix X is thus projected into an orthogonal space spanned by the design variables of \(\tilde {{\mathbf {D}}}\):
The standard PLS regression is then used on X_{Orth} instead of X. This avoids iterations in the algorithm since the residuals associated with \(\tilde {{\mathbf {D}}}\) in the OLS of Y on \(\left [\tilde {{\mathbf {D}}},{\mathbf {T}}\right ]\) are the same as the residuals of Y on \(\tilde {{\mathbf {D}}}\) (the column space of \(\tilde {{\mathbf {D}}}\) and the column space of T are orthogonal). Thus, the residuals do not change during the iterations avoiding the iterative process. This procedure is denoted by
where V is the projection matrix, also called the loading matrix (of size p×κ), which allows us to compute T from X based on the relationship T=XV. The vector \(\hat {{\boldsymbol {\gamma }}}^{\tilde {{\mathbf {D}}}}\) is the estimate of the vector, in which a coefficient exists for each column of \(\tilde {{\mathbf {D}}}\). In the usual regression context, the loading matrix V allows us to compute the coefficients of \(\hat {{\boldsymbol {\gamma }}}^{{\mathbf {X}}}\) using the coefficients in the dimensionreduced space \(\hat {{\boldsymbol {\gamma }}}^{{\mathbf {T}}}\) with \(\hat {{\boldsymbol {\gamma }}}^{{\mathbf {X}}}={\mathbf {V}} \hat {{\boldsymbol {\gamma }}}^{{\mathbf {T}}}\). In the LSPLS context, when X is orthogonalized on \(\tilde {{\mathbf {D}}}\), we can similarly compute the coefficient \(\hat {{\boldsymbol {\gamma }}}^{{\mathbf {X}}}\), in which a coefficient exists for each column of X_{Orth} that is not of X. Note that for a new individual sample (d_{0}^{T},x_{0}^{T})^{T}, the linear predictor associated with the LSPLS methods is given by :
Linear logistic regression  ridge penalty and RIRLS
For a typical designed experiment logistics model, let us consider a general design matrix U of size n×m and the response variable collected in a {0,1}^{n}valued vector Y. We denote U_{i·}, the ith row of U, and Y_{i} as the ith element of Y. The conditional class probability, i.e., the conditional expectation of Y_{i} given U_{i·}, defined by \(\pi _{i}=\mathbb {P}({\mathbf {Y}}_{i}=1 \vert {\mathbf {U}}_{i\cdot }={\mathbf {u}}_{i})\), is related to the linear predictor \({\mathbf {\eta }}_{i} = \left [1 \; {\mathbf {u}}_{i}^{T}\right ] {\boldsymbol {\gamma }}\), with \({\boldsymbol {\gamma }} \in {\mathbb {R}}^{m+1}\) through the nonlinear relation π_{i}=h(η_{i}), where h(η_{i})=1/(1+ exp(−η_{i})). The parameter γ is unknown and must be estimated from the data. Vectors π and η depend on γ and should be written as π^{γ} and η^{γ}, respectively. For the sake of clarity, we use only the notations π and η in this paper. In logistic discrimination, the estimation is usually carried out using \(\hat {{\boldsymbol {\gamma }}}^{\text {ML}}\), i.e., the maximum likelihood (ML) estimator. The loglikelihood of the observations for the value γ of the parameter, simply denoted by ℓ(γ), is given by
Let W(γ) be the diagonal n×n matrix with entries {W(γ)}_{ii}=π_{i}(1−π_{i}). For a vector u_{0}, the predicted class \(\hat {{Y}_{0}}\) of the sample is given by \(\hat {{Y}_{0}}=1_{(\hat {\pi }_{0}> 1\hat {\pi }_{0})}\), where \(\hat {\pi }_{0}=h\left (\left [1\; {\mathbf {u}}_{0}^{T}\right ]^{T} \hat {{\boldsymbol {\gamma }}}^{\text {ML}}\right) \) and 1_{(·)} is the indicator function. When this estimate exists, it is computed as the limit of a NewtonRaphson sequence; this algorithm is known as the iteratively reweighted LS algorithm [32], denoted by IRLS(Y,U). From step t to t+1, we have:
where \(\tilde {{\mathbf {U}}} {=} [1_{n} \; {\mathbf {U}}]\) and W^{(t)} is shorthand notation for W(γ^{(t)}). The quantity π^{(t)} is shorthand notation for the vector of size n whose nth element is given by \(h\left (\tilde {{\mathbf {U}}}_{i\cdot }^{T}{\boldsymbol {\gamma }}^{(t)}\right)\). The IRLS algorithm can thus be considered as an iteratively W(γ^{(t)})weighted LS regression of a \({\mathbb {R}}^{n}\)valued pseudovariable z^{(t)} onto the columns of \(\tilde {{\mathbf {U}}}\). Note that in some cases, including the practical case where n<<m, the existence and unicity of \(\hat {{\boldsymbol {\gamma }}}^{\text {ML}}\) for logit models are not guaranteed. Thus, regularization methods such as the ridge penalty are required. The ridge estimator [33], denoted by \(\hat {{\boldsymbol {\gamma }}}^{R}\), is defined as the (unique) maximizer of the penalized likelihood ℓ^{∗}(γ)=ℓ(γ)−0.5λγ^{T}γ, where λ>0 is the shrinkage parameter. We call this the RidgeIRLS algorithm (RIRLS). It consists of replacing the weighted regression (2) in IRLS with a weighted ridge regression \({\boldsymbol {\gamma }}^{(t+1)} = \left (\tilde {{\mathbf {U}}}^{T} {\mathbf {W}}^{(t)} \tilde {{\mathbf {U}}}+ \lambda \tilde {{\mathbf {I}}}_{m+1} \right)^{1} \tilde {{\mathbf {U}}}^{T} {\mathbf {W}}^{(t)} {\mathbf {z}}^{(t)}\), where z^{(t)} is built as in (1) and \(\tilde {{\mathbf {I}}}_{m+1}\) is a diagonal matrix of size (m+1)×(m+1), the diagonal of which is equal to (0,1,…,1). We then define \(\left (\hat {{\boldsymbol {\gamma }}}^{{\mathbf {U}}}, {\mathbf {z}}^{\infty },{\mathbf {W}}^{\infty }\right) \longleftarrow \text {RIRLS}({\mathbf {Y}},{\mathbf {U}},\lambda)\), where \(\hat {{\boldsymbol {\gamma }}}^{{\mathbf {U}}}\) is the resulting estimator of γ, and z^{∞} is the pseudoresponse variable (resp. the weight matrix W^{∞}) at convergence of the algorithm. Note that when the model does not contain the intercept term (i.e., it uses U instead of \(\tilde {{\mathbf {U}}}\)), the matrix \(\tilde {{\mathbf {I}}}_{m+1}\) is replaced with the identity matrix I_{m}. The parameter λ controls the amount of shrinkage in the data and can be chosen from the data for instance, by a crossvalidation procedure.
Extensions of LSPLS for logistic regression
Extending the LSPLS approach to the framework of the logistic model is not straightforward. For instance, there are several ways to use PLS in the classification context. In the following section, we propose extending three of them [18–20] to LSPLS for logistic regression.
Nguyen and Rocke’s approach.
To extend PLS to logistic regression, [18] first compute the score n×κ matrix T associated with the PLS regression of Y on X. Then, they estimate the parameter in the ML sense by running IRLS(Y,T). If we want to adapt this approach to LSPLS, we have to replace the call to PLS step with LSPLS(Y,D,X,κ) and then perform IRLS(Y,[D T]). The detailed procedure of this LSPLSIRLS method is as follows:
Even if this method yields relatively good results in practice, note that applying PLS (in Step 1) with a binary input Y is unappealing. In addition, the PLSregression step does not consider the heteroscedasticity of the response vector Y. The value of κ can be chosen by crossvalidation.
Marx’s approach.
In [19], the authors introduce an algorithm that extends PLS to generalized linear models, socalled IRPLS. Specifically, IRPLS can be understood as an IRLS algorithm in which the weighted LS regression (2) is replaced with the PLS regression, PLS ([W^{(t)}]^{1/2}z^{(t)},[W^{(t)}]^{1/2}X,κ). Note that PLS applied with the maximal number of PLS components is the same as LS. Note that [19] chooses κ=rank(X); hence, when X is full row rank (which is often the case when n<<p), this algorithm never converges. Some authors (see, for instance, [34, 35]) use similar algorithms but with κ<rank(X). In this case, nothing ensures that this algorithm converges. As previously mentioned, if we want to adapt this approach for LSPLS, we can simply replace the call to PLS with LSPLS. This iterative process, called IRLSPLS, is detailed in the following algorithm.
Iterate until convergence,
where [W^{(t)}]^{1/2} is a square root matrix of W^{(t)} that satisfies [W^{(t)}]^{T/2}[W^{(t)}]^{1/2}=I_{n}, \(\hat {{\boldsymbol {\gamma }}}_{\infty }^{\tilde {{\mathbf {D}}}}\) and \(\hat {{\boldsymbol {\gamma }}}_{\infty }^{{\mathbf {X}}}\) are coefficient estimates obtained at convergence. The drawback of this method is that convergence problems often occur. The parameter κ can also be selected by crossvalidation.
Ridge partial least squares approach.
To extend PLS to the logistic regression model, [20] suggest replacing the binary data with a pseudoresponse variable whose expected value has a linear relationship with the covariates. The pseudoresponse variable z^{∞} at convergence of the RIRLS algorithm verifies this condition: it can be written as \({{\mathbf {z}}}^{\infty }={\mathbf {X}} \hat {{\boldsymbol {\gamma }}}^{R} +{{\boldsymbol {\varepsilon }}}\), where, \( \hat {{\boldsymbol {\gamma }}}^{R}\) subject to being the true value of the parameter, ε is a centered vector of covariance matrix (W^{∞})^{−1}. This procedure is called RPLS. As a consequence, in the same spirit, to extend LSPLS to logistic regression, we can propose a procedure that combines the ridge penalty and LSPLS, called RLSPLS. Let λ be some positive real constant and κ be some positive integer. RLSPLS is divided into two steps:
The first step builds a continuous response variable z^{∞} for the input of LSPLS, the “dispersion matrix” of which is [W^{∞}]^{−1}. This explains the weight [W^{∞}]^{1/2} present in the second step. Note that in Step 1, we do not choose to regularize D with the ridge penalty. When the dimensions of matrix X are low, we may decide to not regularize it by putting λ=0 in Step 1. The RLSPLS method depends on two parameters, λ and κ, that can be selected by crossvalidation.
These three approaches have been implemented in R software version 3.1.2, and an R package called lsplsGlm has been proposed to enhance their use.
Abbreviations
 AUC:

Area under the curve
 GLM:

Generalized linear model
 IRLS:

Iteratively reweighted least squares algorithm
 LS:

Least square
 PCA:

Principal component analysis
 PCR:

Principal component regression
 SIS:

Sure independence screening
References
 1
Müller B, Wilcke A, Boulesteix AL, Brauer J, Passarge E, Boltze J, et al. Improved prediction of complex diseases by common genetic markers: state of the art and further perspectives. Hum Genet. 2016; 135(3):259–72.
 2
GómezRueda H, MartínezLedesma E, MartínezTorteya A, PalaciosCorona R, Trevino V. Integration and comparison of different genomic data for outcome prediction in cancer. BioData Min. 2015; 8(1):32.
 3
Wang Y, Klijn JG, Zhang Y, Sieuwerts AM, Look MP, Yang F, et al. Geneexpression profiles to predict distant metastasis of lymphnodenegative primary breast cancer. Lancet. 2005; 365(9460):671–9.
 4
van Veer LJ, Dai H, van de Vijver MJ, He YD, Hart AA, Mao M, et al.Gene expression profiling predicts clinical outcome of breast cancer. Nature. 2002; 415:530–6.
 5
Paik S, Shak S, Tang G, Kim C, Baker J, Cronin MB, et al.A multigene assay to predict recurrence of tamoxifentreated, nodenegative breast cancer. N Engl J Med. 2004; 351(27):2817–26.
 6
Van De Vijver MJ, He YD, Van’t Veer LJ, Dai H, Hart AA, Voskuil DW, et al.A geneexpression signature as a predictor of survival in breast cancer. N Engl J Med. 2002; 347(25):1999–2009.
 7
Zhao Q, Shi X, Xie Y, Huang J, Shia B, Ma S. Combining multidimensional genomic measurements for predicting cancer prognosis: observations from TCGA. Brief Bioinform. 2014; 16(2):291–303.
 8
Massy WF. Principal components regression in exploratory statistical research. J Am Stat Assoc. 1965; 60(309):234–56.
 9
Helland IS. On the structure of partial least squares regression. Commun Stat Simul Comput. 1988; 17(2):581–607.
 10
Pereira B, Chin SF, Rueda OM, Vollan HKM, Provenzano E, Bardwell HA, et al. The somatic mutation profiles of 2433 breast cancers refines their genomic and transcriptomic landscapes. Nat Commun. 2016; 7:11479.
 11
Beane J, Sebastiani P, Whitfield TH, Steiling K, Dumas YM, Lenburg ME, et al. A prediction model for lung cancer diagnosis that integrates genomic and clinical features. Cancer Prev Res. 2008; 1(1):1940–6207.
 12
Stephenson AJ, Smith A, Kattan MW, Satagopan J, Reuter VE, Scardino PT, et al. Integration of gene expression profiling and clinical variables to predict prostate carcinoma recurrence after radical prostatectomy. Cancer. 2005; 104(2):290–8.
 13
Boulesteix AL, Sauerbrei W. Added predictive value of highthroughput molecular data to clinical data and its validation. Brief Bioinform. 2011; 12(3):215–29.
 14
Dey S, Gupta R, Steinbach M, Kumar V. Integration of clinical and genomic data: a methodological survey. Technical Report no. RT 13005, Department of Computer Science and Engineering University of Minnesota. 2013;48. https://www.cs.umn.edu/research/technical_reports/view/13005.
 15
Boulesteix AL, Porzelius C, Daumer M. Microarraybased classification and clinical predictors: on combined classifiers and additional predictive value. Bioinformatics. 2008; 24(15):1698–706.
 16
Hastie T, Tibshirani R. Generalized additive models. Stat Sci. 1986; 1:297–310.
 17
Jørgensen K, Segtnan V, Thyholt K, Næs T. A comparison of methods for analysing regression models with both spectral and designed variables. J Chemom. 2004; 18(10):451–64.
 18
Nguyen D, Rocke D. Tumor classification by Partial Least Squares using microarray gene expression data. Bioinformatics. 2002; 18(1):39–50.
 19
Marx BD. Iteratively Reweighted Partial Least Squares estimation for Generalized Linear Regression. Technometrics. 1996; 38(4):374–81.
 20
Fort G. LambertLacroix S. Classification using partial least squares with penalized logistic regression. Bioinformatics. 2005; 21(7):1104–11.
 21
Fan J, Lv J. Sure independence screening for ultrahigh dimensional feature space. J R Stat Soc. 2008; 70:849–911.
 22
Dudoit S, Fridlyand J, Speed TP. Comparison of discrimination methods for the classification of tumors using gene expression data. J Am Stat Assoc. 2002; 97(457):77–87.
 23
Pomeroy SL, Tamayo P, Gaasenbeek M. Prediction of Central Nervous System Embryonal Tumour Outcome Based on gene expression. Nature. 2002; 415:436–42.
 24
Curtis C, Shah SP, Chin SF, Turashvili G, Rueda OM, Dunning MJ, et al. The genomic and transcriptomic architecture of 2000 breast tumours reveals novel subgroups. Nature. 2012; 486(7403):346–52.
 25
Boulesteix AL, Hothorn T. Testing the additional predictive value of highdimensional molecular data. BMC Bioinformatics. 2010; 11(1):78.
 26
Lê Cao KA, Meugnier E, McLachlan GJ. Integrative mixture of experts to combine clinical factors and gene markers. Bioinformatics. 2010; 26(9):1192–8.
 27
Bøvelstad HM, Nygård S, Borgan Ø. Survival prediction from clinicogenomic modelsa comparative study. BMC Bioinformatics. 2009; 10(1):413.
 28
Van Wieringen WN, Kun D, Hampel R, Boulesteix AL. Survival prediction using gene expression data: a review and comparison. Comput Stat Data Anal. 2009; 53(5):1590–603.
 29
Chun H, Keleş S. Sparse partial least squares regression for simultaneous dimension reduction and variable selection. J R Stat Soc Ser B Stat Methodol. 2010; 72(1):3–25.
 30
Chung D, Keles S, et al.Sparse partial least squares classification for high dimensional data. Stat Appl Genet Mol Biol. 2010; 9(1):17.
 31
Durif G, Modolo L, Michaelsson J, Mold JE, LambertLacroix S, Picard F. High Dimensional Classification with combined Adaptive Sparse PLS and Logistic Regression. Bioinformatics. 2017. In press.
 32
Green PJ. Iteratively reweighted least squares for maximum likelihood estimation, and some robust and resistant alternatives. J R Stat Soc Ser B Methodol. 1984; 46:149–92.
 33
Le Cessie S, Van Houwelingen JC. Ridge estimators in logistic regression. Appl Stat. 1992; 41:191–201.
 34
Park PJ, Tian L, Kohane IS. Linking gene expression data with patient survival times using partial least squares. Bioinformatics. 2002; 18(suppl_1):120–7.
 35
Nygård S, Borgan Ø, Lingjærde OC, Størvold HL. Partial least squares Cox regression for genomewide data. Lifetime Data Anal. 2008; 14(2):179–95.
Acknowledgements
The authors thank the Alpes Grenoble Innovation Recherche (AGIRPEPS) program of the Communauty University GrenobleAlpes for financial support.
Funding
Our study was supported by a grant from University GrenobleAlpes (AGIRPEPS).
Availability of data and materials
All data corresponding to the Central Nervous System is publicly available in the Rpackage stepwiseCM and available at the Bioconductor website (https://www.bioconductor.org/). The Breast cancer data (somatic CNAs) can be downloaded from the TCGA data portal (https://tcgadata.nci.nih.gov/).
Author information
Affiliations
Contributions
CB and SLL have contributed equally to this work. All authors read and approved this manuscript version.
Corresponding author
Ethics declarations
Ethics approval and consent to participate
Not applicable.
Consent for publication
Not applicable.
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Additional files
Additional file 1
Supplement to the simulation study: Synthetic data with larger variances for influential variables. As reported in the simulation study of the paper, the noninfluential variables having the highest variance may seem unrealistic because the influential gene expression variables can have, in practice, higher variance than the noninfluential ones. We consider here the same example as in the simulation study but invert the variance levels. These simulation results are presented here. (PDF 130 kb)
Additional file 2
Supplement to the real data analysis: CNS data. Plots similar to those in Fig. 3 of the paper corresponding to p_{red} equal to 50, 100, and 750, respectively. (PDF 131 kb)
Additional file 3
Supplement to the real data analysis: breast cancer data. Plots similar to those in Fig. 5 of the paper corresponding to p_{red} equal to 50, 100, and 750, respectively. (PDF 129 kb)
Additional file 4
Supplement to the simulation study: Collinearity issue of the clinicogenomic integration. Results from simulation study addressed to evaluate the collinearity issue of the clinicogenomic integration are presented here. The simulation study is based on that presented in the paper. (PDF 177 kb)
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. 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
Bazzoli, C., LambertLacroix, S. Classification based on extensions of LSPLS using logistic regression: application to clinical and multiple genomic data. BMC Bioinformatics 19, 314 (2018). https://doi.org/10.1186/s1285901823112
Received:
Accepted:
Published:
Keywords
 Classification
 Clinicogenomic model
 Highdimensional data
 Logistic regression
 LSPLS