Table of Contents Author Guidelines Submit a Manuscript
Computational and Mathematical Methods in Medicine
Volume 2015 (2015), Article ID 370640, 14 pages
http://dx.doi.org/10.1155/2015/370640
Research Article

A Novel Hybrid Dimension Reduction Technique for Undersized High Dimensional Gene Expression Data Sets Using Information Complexity Criterion for Cancer Classification

1Department of Statistics, Faculty of Science, Firat University, 23119 Elazig, Turkey
2Department of Business Analytics and Statistics, The University of Tennessee, Knoxville, TN 37996, USA

Received 24 December 2014; Accepted 18 February 2015

Academic Editor: David A. Winkler

Copyright © 2015 Esra Pamukçu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Gene expression data typically are large, complex, and highly noisy. Their dimension is high with several thousand genes (i.e., features) but with only a limited number of observations (i.e., samples). Although the classical principal component analysis (PCA) method is widely used as a first standard step in dimension reduction and in supervised and unsupervised classification, it suffers from several shortcomings in the case of data sets involving undersized samples, since the sample covariance matrix degenerates and becomes singular. In this paper we address these limitations within the context of probabilistic PCA (PPCA) by introducing and developing a new and novel approach using maximum entropy covariance matrix and its hybridized smoothed covariance estimators. To reduce the dimensionality of the data and to choose the number of probabilistic PCs (PPCs) to be retained, we further introduce and develop celebrated Akaike’s information criterion (AIC), consistent Akaike’s information criterion (CAIC), and the information theoretic measure of complexity (ICOMP) criterion of Bozdogan. Six publicly available undersized benchmark data sets were analyzed to show the utility, flexibility, and versatility of our approach with hybridized smoothed covariance matrix estimators, which do not degenerate to perform the PPCA to reduce the dimension and to carry out supervised classification of cancer groups in high dimensions.

1. Introduction

The study of gene expression has been greatly facilitated by DNA microarray technology. Since DNA microarrays measure the expression of thousands of genes simultaneously, there is a great need to develop analytical methodology to analyze and to exploit the information contained in gene expression data [1, 2]. With the wealth of gene expression data from microarrays being produced, more and more new prediction, classification, and clustering techniques are being used for the analysis of the data [3]. Dimension reduction techniques such as principal component analysis (PCA) and several extended forms of PCA such as probabilistic principal component analysis (PPCA), kernel principal component analysis (KPCA) have also been proposed to analyze gene expression data. For more on these methods we refer the readers to Raychaudhuri et al. [1], Yeung and Ruzzo [2], Chen et al. [4], Yang et al. [5], Ma and Kosorok [6], and Nyamundanda et al. [7]. Although these methods are commonly used in the literature, they all inherently have their own idiosyncratic statistical difficulties in analyzing undersized samples in high dimensions due to singularity of the covariance matrix, where these difficulties have not been satisfactorily addressed in the literature. For SVM type kernel methods, although they are useful tools, they have their own limitations in the sense that they are not easily interpretable since the kernel transformation is not one-to-one and onto and the transformation is not invertible. Moreover, for a given data set the choice of the optimal kernel function and the tuning parameters in kernel-based methods has been arbitrary and has remained an unresolved academic research problem in the literature until the recent work of Liu and Bozdogan [8] and Liberati et al. [9].

The main idea of the classical PCA, for example, is to reduce the dimensionality of a data set consisting of a large number of interrelated variables, while retaining as much as possible the variation present in the data set. This is achieved by transforming the data to a new set of variables, the principal components (PCs), which are uncorrelated and ordered [10]. By applying PCA, one is implicitly assuming that the desired information is exactly provided by the percent variance explained. But such an assumption has been questioned and criticized by Scholz [11] in gene expression data analysis. Other nonexhaustive limitations of PCA can be briefly described as follows.(i)When the sample size is much smaller than the number of features (i.e., genes), , that is, when we have , the maximum likelihood (ML) estimator of the covariance matrix is neither invertible nor well conditioned.(ii)Therefore, the classical PCA does not work well since the estimated covariance matrix becomes rank deficient. Such a case in the literature is known as undersized sample problem in high dimensions [12].(iii)PCA suffers from a probabilistic interpretation. That is, it does not have an underlying probability density model.

Estimation of the covariance matrices for small sample size and high dimensions, that is, the problem, is a difficult problem that has recently attracted the attention of many researchers. This problem is prevalent in genomics, microarray data, gene sequencing, medical data mining, and other bioinformatics areas as well as in econometrics and predictive business modeling. This problem is numerically one of the most challenging problems that require new and efficient computational methods.

Due to the curse of dimensionality, almost all of the classical multivariate statistical methods break down and degenerate. This means that the covariance matrix of the data cannot be computed and, as a result, one obtains only poor classification and cluster analysis results. The main reason for this problem is the high noise created by the irrelevant or redundant genes (i.e., features) present in the data.

In this paper, therefore, our main objectives are severalfold to address the limitations of the standard classic PCA and to develop and introduce a new and novel dimension reduction technique for cancer classification. These are as follows.(i)To resolve the problem of small sample size and large number of dimensions, that is, the problem, we introduce several smoothed (or robust) covariance estimators and their hybridized forms with the neglected maximum entropy (ME) covariance matrix.(ii)We introduce and use probabilistic principal component analysis (PPCA) as an alternative to the classic PCA. PPCA is a probabilistic formulation of PCA based on a Gaussian latent variable model. PPCA was developed in the late 1990s and popularized by the work of Tipping and Bishop [13, 14]. PPCA is flexible and has the associated likelihood measure as the quantum of information in the data, which is needed in the model selection criteria and their computations.(iii)A central issue in gene expression data is the dimension reduction before any classification or clustering procedures are meaningfully applied, especially when . In the literature, the task of dimensionality selection has not been solved in a satisfactory way for undersized gene expression data in high dimensions. To this end, we introduce and develop celebrated Akaike’s information criterion (AIC) [15], consistent Akaike’s information criterion (CAIC) of Bozdogan [16], and the information theoretic measure of complexity (ICOMP) criterion of Bozdogan [17, 18] in PPCA model to choose the number of probabilistic PC components to be retained.(iv)Later the PPCs chosen by the information criteria are used as inputs in cancer classification using linear discriminant analysis (LDA) and quadratic discriminant analysis (QDA). The performance of these methods is compared on the well-known six benchmark gene expression data sets to emphasize the importance of the role of dimension reduction to resolve the “curse of dimensionality” of Bellman [19] in cancer classification problems.

Our method has distinct advantages over the previously proposed methods in that we provide analytical means of choosing the number of PPCs via the novel application of information theoretic model selection criteria to reduce the dimension automatically that can be retained and utilized in cancer classification based on sound statistical modeling procedures. We use the entire data set with its high dimensions rather than clusterwise splitting or partitioning of the variables in the analysis process due to the high dimensionality. Our approach has the generalizability property to non-Gaussian latent variable models, probabilistic independent component analysis (PICA), sparse probabilistic principal component analysis (SPPCA), and other methods. The proposed approach is efficient and computationally cost effective; the results obtained are easy to interpret in the original data space and can be used in other supervised or unsupervised cancer classification procedures.

2. Materials and Methods

2.1. Smoothed and Hybridized Covariance Estimators
2.1.1. Maximum Likelihood Covariance Estimation

Let be data matrix. When the data are modeled probabilistically as Gaussian or other elliptically contoured (EC) distributions (non-Gaussians), such as Multivariate t (Mt), multivariate power exponential (MPE), multivariate Cauchy (MC), and multivariate Laplace (MLp), we must estimate the covariance matrix, . When the sample size is much smaller than the dimension or the number of variables (genes), , the usual sample maximum likelihood (ML) estimator of , given in matrix formbecomes unstable, ill-conditioned, nonpositive definite, and even singular. In (1), denotes the transpose of , is the identity matrix, and is a column vector of one of -dimensions. In such a case, we cannot compute the inverse covariance matrix or what is referred to as the “precision matrix,” which is needed in practically all multivariate analysis, which includes supervised and unsupervised classification and kernel-based methods, among many others. This situation is especially true in many applications where we have undersized sample problem.

The “precision matrix,” that is, , depends on the determinant of and has a bias that needs to be reduced to regularize the estimated covariance matrix [20].

2.1.2. Naïve Ridge Estimators of the Covariance Matrix

The usual initial resolution to singular or ill-conditioned covariance matrix problem has been the “naïve” ridge regularizationwhere is the ridge parameter and indicates the ridge or regularized covariance estimator. This estimator tries to work to counteract the ill conditioned covariance by adjusting the eigenvalues of . Usually, the ridge parameter, , is chosen to be very small. How large should be and how small can be have remained arbitrary and do not work well in “large small problems.

2.1.3. Smoothed Covariance Estimators

As an alternative to the “naïve” ridge regularization, many methods have been proposed to improve the estimation of the covariance matrix. All these approaches rely on the concept of shrinkage estimators and perfecting them dating back to the early work of James and Stein [21] and Stein [22] which is known as the “Steinian type shrinkage,” which is implicit also in many Bayesian methods as well as in the maximum entropy (ME) covariance estimation.

The idea of shrinkage estimation of the covariance matrix or what we call smoothed covariance estimators (SCEs) is to take convex combination (i.e., weighted average) of the sample estimator of , , with a suitably chosen target diagonal matrix . The shrinkage or smoothed estimator of the covariance matrix then becomes a convex combination of with some chosen target given bywhere is the optimal shrinkage coefficient (or intensity) which is a parameter between 0 and 1; that is, . It can be a function of the observations. The matrix is referred to as the shrinkage target. Its naïve form can be taken to bewhere denotes the trace of the matrix, ,   are the eigenvalues of the estimated sample covariance matrix, and is the arithmetic mean of the eigenvalues.

The interpretation of the general form of the smoothed covariance matrix estimation in (4) is that it provides a more baseline level of variance and covariance estimation when the sample size is much smaller than the dimension of the data. By using such a weighted average, we put less weight on extremely high or low values in the estimated covariance matrix . This reduces the influence of extremely high or low values and provides a more robust and smoothed estimator. Such a structure minimizes the mean squared error (MSE); that is,where denotes the squared Frobenius norm. It is difficult to compute the MSE of without additional constraints such as the shrinkage or smoothed covariance estimator .

In what follows, in this paper, we introduce several robust, regularized, or smoothed covariance estimators of the form given in (4), which have been developed under several linear and quadratic loss functions.

Selected improved (or smoothed) estimates of the covariance matrix via shrinkage from Bozdogan and Howe [23] and Bozdogan [18] are as follows.

(i) Maximum Likelihood/Empirical Bayes (MLE/EB) Covariance Estimator. Considerwhere denotes the trace of the covariance matrix and is the identity matrix. covariance estimator was proposed by Haff [24]. When a small amount of perturbation is all that is required, has a certain appeal. It is clear that this is of the same form as the naïve ridge regularization.

(ii) Maximum Entropy (ME) Covariance Matrix. Considerwhere is the usual (nonnegative definite) dispersion matrix and is a (positive definite) diagonal matrix with positive elements on the diagonal. These positive elements take the form of a weighted sum of squared differences between successive primary midpoints of the variables and these elements serve as a ridge in the ME covariance matrix. In other words, the construction of ME covariance matrix automatically produces the ridge component directly from the data without the worry of how to choose the ridge parameter as is the case in the usual ridge type of estimators. The main motivation of introducing the ME covariance matrix estimator, which has been ignored in the statistical literature, is that it makes the singular and ill-conditioned covariance matrix positive definite when we have undersized sample data such as the case in gene expression data sets. What is also interesting about the ME covariance matrix is that it uses linear and nonlinear order statistics (OS) in its computation by fully exploiting the information in the data set. The computation of the ME covariance matrix in terms of the CPU time is fast and efficient for high dimensional data and it is not heavy. A Matlab module has been written for the computation of the ME covariance matrix and utilized in our analysis in what follows.

For more on the ME covariance matrix we refer the readers to Theil and Laitinen [25], Fiebig [12], and Theil and Fiebig [26].

(iii) Stipulated Ridge Covariance Estimator (SRE). ConsiderWe note that bias and .

(iv) Stipulated Diagonal Covariance Estimator (SDE). Considerwhere and is the correlation matrix. For SDE, we also note that the bias and .

The SRE and SDE covariance estimators are due to Shurygin [20] (last student of Kolmogorov). SDE avoids scale dependence of the units of measurement of the variables.

(v) Convex Sum Covariance Estimator (CSE). Preceding the series of the work of Ledoit and Wolf [27, 28], based on the quadratic loss function used by Press [29], Chen [30] proposed a convex sum covariance matrix estimator (CSE) given by where For dimensions, is chosen to bewhere data adaptively is computed:

This estimator improves upon the usual covariance by shrinking all the estimated eigenvalues toward their common mean. One obvious advantage of this estimator is that it is operational even when ; that is, the sample size is much smaller than the dimension.

(vi) Bozdogan’s [31] Convex Sum Covariance Estimator (BCSE). Considerwhere and is the sum of the squared deviations of each dimension and is given byAs is well known, sum of squared deviations allows the overall variability in a data set to be attributed to different types or sources of variability, with the relative importance of each being quantified by the size of each component of the overall sum of squares. We calculate the sum of squares per degree of freedom or the variance and then divide by the total degree of freedom to get (16), which is used in the estimated shrinkage target.

(vii) Eigenvalue Stabilization of the Covariance Matrix (Thomaz [32]) (STA). Stabilization algorithm is as follows.(1)Find the eigenvectors () and eigenvalues () of the covariance matrix.(2)Compute the mean or average eigenvalue of the covariance matrix: (3)Form a new matrix of eigenvalues based on the following largest dispersion values: (4)Finally, reform the modified newly stabilized covariance matrix:

There are other smoothed covariance matrices. For space considerations, the ones above that we are studying in this paper will suffice for the results in this paper.

2.1.4. Hybridized Smoothed ME Covariance Estimator

We can choose any of the smoothed covariance estimators and stabilize their eigenvalues with the STA algorithm above. However, in this paper more specifically we propose focussing our attention on the ME covariance matrix and stabilizing its eigenvalues using the eigenvalue stabilization of Thomaz [32]. Then, we hybridize our result with other smoothed covariance matrix estimators in reducing the dimension of the undersized data in high dimensions in the PPCA model using the information theoretic model selection criteria. The rationale and mathematical motivation of stabilization plus hybridization are to improve further in a straightforward way the smaller and less reliable eigenvalues of the estimated covariance matrix while trying to keep most of its larger eigenvalues unchanged before smoothing to guarantee that the eigenvalues of a nonnegative definite matrix do not become negative and to achieve positive definiteness via shrinkage. These hybrid regularized covariance estimators greatly enhance supervised and unsupervised classification error rates after the dimension reduction and for general inferences in multivariate modeling.

For example, we stabilize the ME covariance matrix and obtain Then, we hybridize , say, with the convex sum covariance estimator (CSE) and compute

We call such a process “hybridized covariance estimator,” . Similarly, we can hybridize other smoothed covariance estimators. These hybridized smoothed (or robust) estimators of the covariance matrix overcome the singularity of the covariance matrix for undersized gene expression data sets and avoid negative eigenvalues.

As an illustration of our proposed approach to resolve the undersized sample problem, we discard the group structure of the colon benchmark data set for the time being and compute the usual sample covariance matrix, . Then, to remedy the singularity problem, we compute the maximum entropy (ME) covariance matrix, . Later, we hybridize the ME covariance matrix with other smoothed (or robust) covariance estimators. We denote this by as in (21). Now we compute the eigenvalues of these covariance estimators and compare them with the eigenvalues of the MLE type smoothed covariance estimator. Our results for both MLE based smoothed covariance matrices and the hybridization of the ME covariance with the smoothed covariances for the colon cancer data set are shown in Figures 1(a)-1(b).

Figure 1: The eigenvalues for MLE and ME covariance matrices and their hybridizations with other smoothed covariance matrices.

Looking at Figure 1, we note that the eigenvalues of are all zeros after the first eigenvalue that further shows the severe singularity since the colon data set is undersized. To remedy this problem, we can see that maximum entropy (ME) covariance matrix, , recovers the singularity. ME covariance matrix estimator hybridization, , with other smoothed covariances improves the singularity further and also makes the covariance nonsingular which shows the recovery of the singularity with our approach. The corresponding eigenvalues of the final covariance estimator are well conditioned and are positive providing a positive definite covariance matrix that can be inverted.

It is important to emphasize here that our proposed approach works for practically all the undersized benchmark gene expression data sets. It has distinct advantage over currently used methods for recovering the singularity of the estimated covariance matrices in undersized gene expression data sets or in general. It is analytical and numerically stable. It is easy to compute and efficient.

2.2. Information Complexity: ICOMP Criterion

In general statistical modeling and model evaluation problems, the concept of model complexity plays an important role. At the philosophical level, complexity involves notions such as connectivity patterns and the interactions of model components. Without a measure of overall model complexity, prediction of model behavior and assessing model quality is difficult. This requires detailed statistical analysis and computation to choose the best fitting model among a portfolio of competing models for a given finite sample [33].

The development of information theoretic measure of complexity (ICOMP) criterion has been motivated in part by Akaike’s classic information criterion (AIC) given bywhere is the maximized likelihood function, is the maximum likelihood estimate of the parameter vector under the model , and is the number of independent parameters estimated when is the model and in part by information complexity concepts and indices.

Bozdogan [16] improved and extended AIC analytically in two ways without violating Akaike’s principles using the established results in mathematical statistics. One of these extensions that make AIC asymptotically consistent is CAIC which is defined byWe note that, in AIC and CAIC, the compromise takes place between the maximized log likelihood, that is, (the lack-of-fit component) and , the number of free parameters, and , the penalty term, where is the natural logarithm of the sample size , respectively.

In contrast to AIC and CAIC, the information complexity ICOMP criterion is based on covariance complexity index of van Emden [34]. Instead of penalizing the number of free parameters directly, ICOMP penalizes the covariance complexity of the model.

ICOMP is defined by where is the estimated covariance matrix of the model and is the maximal entropic complexity given bywhere .

Hence, ICOMP in its idealized form is an additive composition of a term which measures the lack of fit (i.e., inference uncertainty), a second term which measures the complexity of the covariance matrix of the parameter estimates of a model, which represents the parametric uncertainty of a model. It provides a more judicious penalty term and balances the overfitting and underfitting risks of a model compared to that of AIC. Indeed, this new approach provides an entropic general data-adaptive penalty functional, which is random and is an improvement over a fixed choice of penalty functional such as in AIC or its variants.

There are several forms and theoretical justifications of ICOMP. In this paper, we introduce and score only the consistent form of ICOMP, CICOMP given byIn (26), represents the second order Frobenius norm characterization of the original complexity of and in terms of eigenvalues, it is given bywhere is the arithmetic mean of the eigenvalues of .

We note that is scale-invariant and with when all . Also, measures the relative variation in the eigenvalues rather than absolute variation of the eigenvalues. For more details on the analytical developments of these information complexity criteria, we will refer the readers to Bozdogan [1618, 23, 31, 33, 3540].

A model with the minimum information criteria score is chosen to be the best model among the competing alternative models.

When , in the next section, we introduce and develop a novel approach to reduce the dimension of large microarray data sets for supervised and unsupervised classification. Although the use of the classic principal component analysis (PCA) has been commonly used method for dimension reduction, it is problematic especially in gene expression data analysis since the data sets are extremely undersized and high dimensional. The eigenvalue is not a good estimator of the variance of the th PC, since the estimated covariance matrix is singular with degenerate zero eigenvalues. In this sense, in the literature the task of dimensionality selection has not been solved in a satisfactory way for undersized samples.

2.3. Dimension Reduction with Probabilistic Principal Component Analysis (PPCA)
2.3.1. Gaussian Latent Variable Model

Probabilistic principal component analysis (PPCA) is a Gaussian probabilistic generalization of PCA. It has been used in many areas. In its formulation PPCA presumes a linear latent variable model relating an observed variable with a latent variable that is inferred only from observed variable through a linear mapping called factor loading. PPCA offers several advantages over the PCA. These include hybridized regularization procedures such as the one proposed in this paper, model selection for dimension reduction, easy interpretation of the results, and its generalizability to other distributional models other than the Gaussian model. PPCA can also be viewed as a marginal density or a predictive model in its setup.

In this paper, we use the maximum likelihood estimates (MLEs) of the parameters of PPCA. The MLE approach computationally is efficient and works well for high dimensional data.

To be more specific, following Tipping and Bishop [13, 14] in matrix notation, we express the probabilistic principal component analysis (PPCA) model as a mapping (or transformation) from latent space into the data space viawhere is a vector of high dimensional observed variables (genes), is a factor loading matrix that represents a linear transformation, that is, , is latent variable, is a mean vector, and is multivariate Gaussian random error (or noise) for independent of the latent variable .

We note that the latent variable model in (28) clearly shows the idea of dimensionality reduction since a high dimensional observation vector can be represented by a low-dimensional latent variable through the mapping such that , where is the number of latent variables (PPCs) and is the dimension of the data.

In order to be able to introduce the probabilistic modeling of , we assume that(i)the probability density of is a unit spherical Gaussian: ,(ii)the probability density of is spherical Gaussian: .

Finally, the observed variable ends up with a Gaussian probability model where the covariance matrix of the observation vector is

2.3.2. Probability Model

The probability distribution is formulated with the help of the probability model of the random error given by

Since , the conditional probability of given , that is, , can be obtained from . This is given bywhere denotes the square of the matrix norm.

Under the Gaussian prior probability the distribution of is given by

Since , the marginal probability distribution, iswhich is again a Gaussian model with covariance matrix

In addition, using the Bayes rule, we can also directly obtain the posterior probability distribution of given ; that is, we can obtain such thatwhere an matrix is given by . We note that the posterior mean of the latent variable depends on the observation vector , whereas the posterior covariance matrix is independent of .

From the above setup, we observe that PPCA is a constrained covariance model, since is while is .

2.3.3. Maximum Likelihood Estimates of the Parameters

The goal of PPCA is to estimate the unknown parameters , and the noise variance from observations using the method of maximum likelihood. To achieve this, we need to produce the likelihood and log likelihood function of the model. The likelihood function for a given observations is given byThus, whereis the sample covariance matrix of the observed data and is the maximum likelihood estimate of the mean vector , which is given byregardless of and .

The log likelihood function is, therefore, given by

Maximization with respect to and is more complex but nevertheless has an exact closed form solution. As shown in Tipping and Bishop [13, 14], without going into details, explicit maximum likelihood estimates of and are obtained from (30) given by

In (42), is a matrix whose columns are given by the leading eigenvectors (PCs) of the sample covariance matrix , the diagonal matrix has elements given by the corresponding eigenvalues , and is an arbitrary orthogonal matrix. For convenience often is chosen to be the identity matrix; that is, . When , we note that the columns of are the PCs scaled by variance parameter . The maximum likelihood estimator, , of the noise variance is nothing but the average of the left-out eigenvalues of the sample covariance matrix given in (39).

Assuming that has nonzero eigenvalues (or singular values) and substitutinginto the log likelihood function, we have

Maximizing (45) with respect to gives

After some work and simplifications, the maximized log likelihood function is given by where the second term is the sum of the log of the eigenvalues corresponding to the included variables. At these parameter values, the estimated covariance is , where contains all the eigenvalues of . is almost a matrix with eigenvalues of on the diagonals given bywhere is an indicator function [40].

Minus twice the maximized log likelihood is

This gives us the lack-of-fit component in the information criteria, which we need in deriving them. In (49), the first term and the last term do not involve , the number of nonzero eigenvalues (or singular values), so they will not affect the comparison of the models and can be dropped. Hence, approximate maximized log likelihood becomes

In addition to the maximum likelihood estimation, there is also the Expectation and Maximization (EM) algorithm of Dempster and Laird [41] to obtain the MLEs of the parameters of the PPCA model. However, our experience is that EM algorithm is too slow to converge in small sample and high dimensional data sets without the use of some smoothing methods.

2.3.4. Choosing the Number of PPCs: Derived Forms of the Information Criteria

How many eigenvalues or eigenvectors are needed in the probabilistic PCA (PPCA) model? To answer this question, we now show the derived forms of several information based model selection criteria to choose number of eigenvalues needed in the PPCA model. These criteria are computed using the hybridized smoothed covariance matrix of the original data as we discussed above. Smoothed eigenvalues and eigenvectors are sorted and heuristics is used to extract the maximum number of PPCs. The approximate computational derived forms of the information criteria are given as follows.

First, we give Akaike’s information criterion (AIC):where is the number of free parameters estimated in the model.

Next we give the approximate computational forms of Bozdogan’s [16, 31] consistent AIC (CAIC) and consistent ICOMP (CICOMP) criteria. Considerwhere is the Frobenius norm characterization of the entropic complexity measure of , which is given bywhere and is th eigenvalue of , the hybridized smoothed covariance matrix, and is the average of the eigenvalues.

We use these criteria to choose the number of PPCs in the data to reduce the dimension. As noted the manifestation of the singular covariance matrices has been resolved by using the new hybridized smoothed (or robust) estimators of the covariance matrix when the sample size for the gene expression data is much smaller than the number of dimensions. The minimum of the criteria is chosen to be the best approximating dimension.

3. Numerical Examples Based on Benchmark Gene Expression Data Sets

To study the effectiveness, versatility, and the utility of our proposed method, in this section we report the results of our analysis on six publicly available benchmark gene expression data sets. Although these benchmark data sets are relatively old microarray gene expression data sets, our methodology is useful for the analysis of high quality of genomic data obtained from next generation sequencing (NGS) technologies as well.

We compare our results with the currently available findings on the same data sets using other high dimensional classification techniques. The list of the benchmark data sets we considered is represented in Table 1.

Table 1: Benchmark gene expression data sets.

We note that all these six data sets are extremely undersized with high dimensions with two (cancerous tumor and normal groups), three (subtypes of lymphoma), four (with different tumor types), and five groups (with different tumor types). Further, group sample sizes are also extremely undersized leading to the manifestation of singular covariance matrices.

3.1. Supervised Classification Using LDA and QDA: A Motivational Example

In order to motivate the difficulty of the supervised classification of these benchmark data sets, we use first 5, 10, and 15 genes to carry out the LDA, QDA to classify the observations. Table 2 summarizes the results obtained from both LDA and QDA.

Table 2: Classification results of benchmark gene expression data sets using the 5, 10, and 15 original genes.

Looking at Table 2, we see high percentage of misclassification rates across different benchmark data sets. In the analysis, we cannot go beyond 15 original genes to analyze these data sets since the estimated class covariance matrices become notoriously singular and any further results obtained from these classification procedures become not reliable and potentially misleading. What this means is that we cannot capture the variability, the structure, and the full information in these data sets. This is crucial in treatment and prognosis of classification of cancerous tumors in the early face of discovery. Therefore, a word of caution is that one should not haphazardly utilize these supervised classification procedures automatically when we have undersized sample with high dimensions to carry out the usual discriminant analysis between groups of samples.

3.2. Dimension Reduction and Supervised Classification Using PPCA and Information Criteria

Next, we carried out PPCA using AIC, CAIC, and consistent ICOMP (CICOMP) criterion using the hybridized smoothed (or robust) covariance estimator. We used several combinations of hybridization. Contrary to the claimed results, just using the smoothed covariance estimators alone in undersized samples, it is not fully guaranteed to get all positive eigenvalues to make the estimated covariance matrix become positive definite and well-conditioned. It is because of this that we considered all the combinations of the hybridized covariance matrices and chose those hybrid smoothed covariance estimators to reduce the dimension of the PPCA model. We interpret PPCA results as density estimation that operates exclusively on the eigenvalues of the hybridized smoothed covariance matrix.

After the dimension reduction using PPCA, the final stage of our analysis consists of classification using the newly transformed PPCA data.

As an illustration, Figure 2 shows the plots of the minimum values of three information criteria in choosing the number of best PPCs for the colon data set.

Figure 2: The plots of the minimum values of three information criteria in choosing the number of best PPCs for colon data set.

After reducing the dimension of all the benchmark gene expression data sets, the results from PPCA dimension reduction and classification using newly transformed PPCA data for AIC, CAIC, and ICOMP solutions are summarized in Tables 3 and 4.

Table 3: Results from the dimension reduction with PPCA + classification of benchmark data sets using AIC.
Table 4: Results from the dimension reduction with PPCA + classification of benchmark data sets using CAIC and CICOMP.

Looking at Tables 3 and 4, we see the remarkable performance of the LDA and QDA classifiers with our approach using PPCA in terms of the misclassification error rates after the dimension reduction. Although the performances vary across different data sets, which is expected, our results are encouraging since the PPCs as latent variables are the linear combinations of all the original genes, and we can use these transformed data as our new data in our subsequent analysis without losing much information in the original data sets. The other important point to mention here is that we have not altered or perturbed the original data with our approach.

Based on these results, we observe that, using the combination of PPCA and the usual classification methods with the proposed new approach, we do not overfit the model as the case is for many supervised learning methods in gene expression data analysis.

For example, if we compare our results on the same six benchmark data sets with that of the classification results obtained by Dettling [42] using seven classification techniques, Bagboost, Boosting, Random Forest, SVM, PAM, DLDA, and kNN classifiers, our percent misclassification error rates are much better across the six data sets using the LDA and QDA classifier. For example, for Leukemia data set Dettling’s best result with SVM gives 1.83% misclassification error rate, with our approach PPCA + LDA giving 1.38% and PPCA + QDA giving 0.0% misclassification error rate. For colon data, PPCA + QDA gives 14.52% misclassification error rate as compared to Random Forest method, which is 14.86%. For prostate data set, with PPCA + QDA, we obtain 7.84% misclassification error rate as compared to the best result with Bagboost, which is 7.53%, and with SVM 7.88%. For lymphoma data set, with PPCA + QDA we get 0.0% misclassification error rate, and Dettling gets 1.62% with Random Forest 1.24% and with Bagboost 1.62% misclassification error rates. For the SRBCT data set the best result is with Bagboost 1.24% as opposed to our result with PPCA + LDA and QDA; it is 0.0%. Finally for the brain data none of the seven classification techniques used by Dettling gives good error rates. These error rates are all above 20% which is quite high. With our approach, our results with PPCA + LDA give 9.52% and with PPCA + QDA give 4.76% misclassification error rates. Further, we do not need to use the usual PCA on the estimated covariance matrix of the pooled samples and rotate the data and then carry out existing high dimensional classifiers.

4. Conclusions, Discussion, and Future Work

In this paper we introduced a general novel and new method to resolve the inherent problems in undersized gene expression data via the hybridized smoothed covariance estimators to guarantee positive definiteness of the estimated covariance matrix via hybridization with smoothed covariance estimators in undersized samples with high dimensions. We showed on six benchmark data sets how to reduce the dimension using three information theoretic model selection criteria to drive and study the cancer tumor classification problem using the hybridized covariance estimators. Our results are unique in the sense that if we use the original data sets using the usual covariance estimator, there are singularities in the class covariance matrices according to QDA results. What this means is that the conventional multivariate techniques such as classical PCA to reduce the dimensionality in gene expression data sets do not work and they degenerate since the covariance matrices become singular. This point has been overlooked in the statistical literature. To our best knowledge, there does not exist a new and novel method to make the estimated covariance matrix become positive definite that can be inverted for the original data and guarantee always-positive eigenvalues.

Although we analyzed and demonstrated our results on several publicly available benchmark relatively old microarray gene expression data sets, our novel methodology is useful for the analysis of high quality of genomic data obtained from next generation sequencing (NGS) technologies. As is well known, NGS technologies opened the floodgates for quality new genomic data. NGS instruments, the so-called second-generation sequencers, generate large volumes of data compared with conventional Sanger sequencers. There is a pressing need for new and novel methods such as the ones presented in this paper to analyze and interpret genomic data better with undersized samples and high dimensions. For example, the identification of new disease genes may provide new therapeutic targets and improve the predictive abilities of genetic testing. This will help clinical sequencing of patients suffering from disease and may eventually guide diagnosis and treatment decisions in personalized medicine.

Our proposed method can be used to solve new problems and challenges present in the analysis of NGS data in bioinformatics and other biomedical applications.

The use and introduction of the information criteria may be new for dimension reduction in PPCA model, but our approach is confined to dimension reduction. It has many other applications in predictive computational modeling of physical and biological diverse materials also using machine-learning methods in choosing the optimal kernel function among competing alternative kernels. For more on applications of these, see, for example, Liu and Bozdogan [8] and Liberati et al. [9].

In the literature, often support vector type kernelization is used, but SVM is not free from ill conditioning. In the SVM framework, reduced-rank approximations have been used to carry out the analysis in the reproducing kernel Hilbert feature space (RKHS). With our approach, it is now possible to handle singular ill-posed problems in the analysis of gene expression and NGS data.

In our future study, we will extend the results of this work to cover non-Gaussian PPCA, kernel density PPCA, probabilistic independent component analysis (PICA), and unsupervised mixture model cluster analysis problems as well as choosing the best subset of the genes using the genetic algorithm (GA) with ICOMP as the fitness function and compare their performances with other strategies. Our results will be published and reported separately.

Availability of Supporting Data. The publicly data sets are available at http://www.biomedcentral.com/1471-2105/7/228#B9.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

Esra Pamukçu would like to thank the Council of Higher Education of Turkey for funding to work with Professor Hamparsum Bozdogan at the University of Tennessee in Knoxville, USA, for three months as a Visiting Doctoral Scholar. Also the supervision and the hospitality of Professor Bozdogan as her coadvisor on these problems are acknowledged and greatly appreciated. Esra would like to thank Professor Çalık as her Department Head for allowing her to visit USA. The authors appreciate the careful reading of this paper by Dr. Kirk Bozdogan of MIT and making valuable comments and corrections, which resulted in the improvement of the paper. The authors also acknowledge the comments and recommendations of anonymous reviewer(s) that improved the quality of this paper. SARIF Publication Award for Professor Bozdogan from the University Tennessee Research Office is greatly acknowledged.

References

  1. S. Raychaudhuri, J. M. Stuart, and R. B. Altman, “Principal components analysis to summarize microarray experiments: application to sporulation time series,” in Proceedings of the Pacific Symposium on Biocomputing, pp. 455–466, 2000.
  2. K. Y. Yeung and W. L. Ruzzo, “Principal component analysis for clustering gene expression data,” Bioinformatics, vol. 17, no. 9, pp. 763–774, 2001. View at Publisher · View at Google Scholar · View at Scopus
  3. D. S. Huang and C. H. Zheng, “Independent component analysis-based penalized discriminant method for tumor classification using gene expression data,” Bioinformatics, vol. 22, no. 15, pp. 1855–1862, 2006. View at Publisher · View at Google Scholar · View at Scopus
  4. X. Chen, L. Wang, J. D. Smith, and B. Zhang, “Supervised principal component analysis for gene set enrichment of microarray data with continuous or survival outcomes,” Bioinformatics, vol. 24, no. 21, pp. 2474–2481, 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. L.-W. Yang, E. Eyal, I. Bahar, and A. Kitao, “Principal component analysis of native ensembles of biomolecular structures (PCA_NEST): insights into functional dynamics,” Bioinformatics, vol. 25, no. 5, pp. 606–614, 2009. View at Google Scholar
  6. S. Ma and M. R. Kosorok, “Identification of differential gene pathways with principal component analysis,” Bioinformatics, vol. 25, no. 7, pp. 882–889, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. G. Nyamundanda, L. Brennan, and I. C. Gormley, “Probabilistic principal component analysis for metabolomic data,” BMC Bioinformatics, vol. 11, article 571, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. Z. Liu and H. Bozdogan, “Kernel PCA for feature extraction with information complexity,” in Statistical Data Mining & Knowledge Discovery, pp. 309–322, Chapman & Hall/CRC, Boca Raton, Fla, USA, 2004. View at Google Scholar · View at MathSciNet
  9. C. Liberati, J. A. Howe, and H. Bozdogan, “Data adaptive simultaneous parameter and kernel selection in kernel discriminant analysis using information complexity,” Journal of Pattern Recognition Research, vol. 4, no. 1, pp. 119–132, 2009. View at Publisher · View at Google Scholar
  10. I. T. Jolliffe, Principal Component Analysis, Springer Series in Statistics, Springer, New York, NY, USA, 2nd edition, 2002. View at MathSciNet
  11. M. Scholz, Approaches to analyse and interpret biological profile data [Ph.D. dissertation], Postdam University, Potsdam, Germany, 2006.
  12. D. G. Fiebig, “On the maximum-entropy approach to undersized samples,” Applied Mathematics and Computation, vol. 14, no. 3, pp. 301–312, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. Tipping and M. C. Bishop, “Probabilistic principal component analysis,” Tech. Rep. NCRG/97/10, 1997. View at Google Scholar
  14. M. E. Tipping and C. M. Bishop, “Probabilistic principal component analysis,” Journal of the Royal Statistical Society Series B: Statistical Methodology, vol. 61, no. 3, pp. 611–622, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  15. H. Akaike, “Information theory and an extension of the maximum likelihood principle,” in Information Theory: Proceedings of the 2nd International Symposium, B. N. Petrov and F. Csaki, Eds., pp. 267–281, Academiai Kiado, Budapest, Hungary, 1973. View at Publisher · View at Google Scholar
  16. H. Bozdogan, “Model selection and Akaike's information criterion (AIC): the general theory and its analytical extensions,” Psychometrika, vol. 52, no. 3, pp. 345–370, 1987. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. H. Bozdogan, “On the information-based measure of covariance complexity and its application to the evaluation of multivariate linear models,” Communications in Statistics. Theory and Methods, vol. 19, no. 1, pp. 221–278, 1990. View at Publisher · View at Google Scholar · View at MathSciNet
  18. H. Bozdogan, Information Complexity and Multivariate Learning in High Dimensions with Applications, Forthcoming Book, 2015.
  19. R. Bellman, Adaptive Control Processes: A Guided Tour, Princeton University Press, New Jersey, NJ, USA, 1961. View at MathSciNet
  20. A. Shurygin, “The linear combination of the simplest discriminator and Fisher's one,” in Applied Statistics, Nauka, Ed., Nauka, Moscow, Rusia, 1983. View at Google Scholar
  21. W. James and C. Stein, “Estimation with quadratic loss,” in Proceedings of the 4th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 361–379, Berkeley, Calif, USA, 1961.
  22. C. Stein, “Estimation of a covariance matrix, Rietz Lecture,” in Proceedings of the 39th Annual Meeting IMS, Atlanta, Ga, USA, 1975.
  23. H. Bozdogan and J. A. Howe, “Misspecified multivariate regression models using the genetic algorithm and information complexity as the fitness function,” European Journal of Pure and Applied Mathematics, vol. 5, no. 2, pp. 211–249, 2012. View at Google Scholar · View at MathSciNet
  24. L. R. Haff, “Empirical Bayes estimation of the multivariate normal covariance matrix,” The Annals of Statistics, vol. 8, no. 3, pp. 586–597, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  25. H. Theil and K. Laitinen, “Singular moment matrices in applied econometrics,” in Multivariate Analysis, P. R. Krishnaiah, Ed., pp. 629–649, North-Holland, Amsterdam, The Netherlands, 1980. View at Google Scholar
  26. H. Theil and D. G. Fiebig, Exploiting Continuity: Maximum Entropy Estimation of Continuous Distributions, Ballinger Publishing Company, Cambridge, Mass, USA, 1984.
  27. O. Ledoit and M. Wolf, “Improved estimation of the covariance matrix of stock returns with an application to portfolio selection,” Journal of Empirical Finance, vol. 10, no. 5, pp. 603–621, 2003. View at Publisher · View at Google Scholar · View at Scopus
  28. O. Ledoit and M. Wolf, “A well-conditioned estimator for large-dimensional covariance matrices,” Journal of Multivariate Analysis, vol. 88, no. 2, pp. 365–411, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. S. Press, “Estimation of a normal covariance matrix,” Tech. Rep., University of British Columbia, 1975. View at Google Scholar
  30. M. Chen, “Estimation of covariance matrices under a quadratic loss function,” Research Report S-46, Department of Mathematics, Stony Brook University, Albany, NY, USA, 1976. View at Google Scholar
  31. H. Bozdogan, Shrinkage Covariance Estimators, Unpublished Lecture Notes, 2010.
  32. C. E. Thomaz, Maximum entropy covariance estimate for statistical pattern recognition [Ph.D. thesis], Department of Computing Imperial College, University of London, London, UK, 2004.
  33. H. Bozdogan, “Intelligent statistical data mining with information complexity and genetic algorithms,” in Statistical Data Mining and Knowledge Discovery, H. Bozdogan, Ed., pp. 15–56, Chapman & Hall/CRC, Boca Raton, Fla, USA, 2004. View at Google Scholar · View at MathSciNet
  34. M. H. van Emden, An Analysis of Complexity, Mathematical Centre Tracts, Amsterdam, The Netherlands, 1971.
  35. H. Bozdogan, “Choosing the number of component clusters in the mixture-model using a new informational complexity criterion of the inverse-fisher information matrix,” in Information and Classification, O. Opitz, B. Lausen, and R. Klar, Eds., Studies in Classification, Data Analysis and Knowledge Organization, pp. 40–54, Springer, Berlin, Germany, 1993. View at Publisher · View at Google Scholar
  36. H. Bozdogan, “Mixture-model cluster analysis using a new informational complexity and model selection criteria,” in Multivariate Statistical Modeling: Proceedings of the 1st US/Japan Conference on the Frontiers of Statistical Modeling: An Informational Approach, H. Bozdogan, Ed., pp. 69–113, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994. View at Google Scholar
  37. H. Bozdogan and D. M. A. Haughton, “Informational complexity criteria for regression models,” Computational Statistics & Data Analysis, vol. 28, no. 1, pp. 51–76, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  38. H. Bozdogan, “Akaike's information criterion and recent developments in information complexity,” Journal of Mathematical Psychology, vol. 44, no. 1, pp. 62–91, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. H. Bozdogan, “A new class of information complexity (ICOMP) criteria with an application to customer profiling and segmentation,” Istanbul University Journal of the School of Business Administration, vol. 39, no. 2, pp. 370–398, 2010. View at Google Scholar
  40. H. Bozdogan and J. A. Howe, “Dimension reduction with probabilistic principal component analysis with the genetic algorithm and misspecification-resistant multivariate regression,” Under review in Statistical Methodology.
  41. A. S. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” Journal of the Royal Statistical Society Series B: Methodological, vol. 39, no. 1, pp. 1–38, 1977. View at Google Scholar · View at MathSciNet
  42. M. Dettling, “BagBoosting for tumor classification with gene expression data,” Bioinformatics, vol. 20, no. 18, pp. 3583–3593, 2004. View at Publisher · View at Google Scholar · View at Scopus
  43. T. R. Golub, D. K. Slonim, P. Tamayo et al., “Molecular classification of cancer: class discovery and class prediction by gene expression monitoring,” Science, vol. 286, no. 5439, pp. 531–537, 1999. View at Publisher · View at Google Scholar · View at Scopus
  44. U. Alon, N. Barka, D. A. Notterman et al., “Broad patterns of gene expression revealed by clustering analysis of tumor and normal colon tissues probed by oligonucleotide arrays,” Proceedings of the National Academy of Sciences of the United States of America, vol. 96, no. 12, pp. 6745–6750, 1999. View at Publisher · View at Google Scholar · View at Scopus
  45. D. Singh, P. G. Febbo, K. Ross et al., “Gene expression correlates of clinical prostate cancer behavior,” Cancer Cell, vol. 1, no. 2, pp. 203–209, 2002. View at Publisher · View at Google Scholar · View at Scopus
  46. A. A. Alizadeh, M. B. Elsen, R. E. Davis et al., “Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling,” Nature, vol. 403, no. 6769, pp. 503–511, 2000. View at Publisher · View at Google Scholar · View at Scopus
  47. J. Khan, J. S. Wei, M. Ringnér et al., “Classification and diagnostic prediction of cancers using gene expression profiling and artificial neural networks,” Nature Medicine, vol. 7, no. 6, pp. 673–679, 2001. View at Publisher · View at Google Scholar · View at Scopus
  48. S. L. Pomeroy, P. Tamayo, M. Gaasenbeek et al., “Prediction of central nervous system embryonal tumour outcome based on gene expression,” Nature, vol. 415, no. 6870, pp. 436–442, 2002. View at Publisher · View at Google Scholar · View at Scopus