Volume 6 Supplement 3

Selected articles from the IEEE International Conference on Bioinformatics and Biomedicine 2012: Medical Genomics

Open Access

Integrating fMRI and SNP data for biomarker identification for schizophrenia with a sparse representation based variable selection method

  • Hongbao Cao1,
  • Junbo Duan2, 3,
  • Dongdong Lin2,
  • Vince Calhoun4, 5 and
  • Yu-Ping Wang2, 3Email author
BMC Medical Genomics20136(Suppl 3):S2

DOI: 10.1186/1755-8794-6-S3-S2

Published: 11 November 2013

Abstract

Background

In recent years, both single-nucleotide polymorphism (SNP) array and functional magnetic resonance imaging (fMRI) have been widely used for the study of schizophrenia (SCZ). In addition, a few studies have been reported integrating both SNPs data and fMRI data for comprehensive analysis.

Methods

In this study, a novel sparse representation based variable selection (SRVS) method has been proposed and tested on a simulation data set to demonstrate its multi-resolution properties. Then the SRVS method was applied to an integrative analysis of two different SCZ data sets, a Single-nucleotide polymorphism (SNP) data set and a functional resonance imaging (fMRI) data set, including 92 cases and 116 controls. Biomarkers for the disease were identified and validated with a multivariate classification approach followed by a leave one out (LOO) cross-validation. Then we compared the results with that of a previously reported sparse representation based feature selection method.

Results

Results showed that biomarkers from our proposed SRVS method gave significantly higher classification accuracy in discriminating SCZ patients from healthy controls than that of the previous reported sparse representation method. Furthermore, using biomarkers from both data sets led to better classification accuracy than using single type of biomarkers, which suggests the advantage of integrative analysis of different types of data.

Conclusions

The proposed SRVS algorithm is effective in identifying significant biomarkers for complicated disease as SCZ. Integrating different types of data (e.g. SNP and fMRI data) may identify complementary biomarkers benefitting the diagnosis accuracy of the disease.

Background

Schizophrenia (SCZ) is one of the most disabling and emotionally devastating illnesses. The global median lifetime morbid risk for schizophrenia is 7.2/1,000 persons [1]. Genetic factors play an important role in the development of schizophrenia. To date, over 1000 genes have been reported to associate with SCZ (http://​www.​szgene.​org/​default.​asp) and many SNPs have been identified as biomarkers for the disease [24]. For example, Kordi-Tamandani et al. showed that that promoter methylation of the CTLA4 gene can increase the risk of SCZ disease [2]. Shayevitz et al. confirmed the gene NOTCH4 as a candidate gene for schizophrenia with genome-wide association studies (GWAS) [3]. Chen et al. stated that three SNPs spanning the MYO5B gene are significantly associated with SCZ: rs4939921, rs1557355 and rs4939924 [4]. Besides genomic data, fMRI is another widely used data modality in SCZ studies [5][6]. To date, many methods have been proposed to integrate multi-types of data in SCZ disease study [711]. For example, Chen et al. proposed parallel independent component analysis (paraICA) to identify genomic risk components associated with brain function abnormalities and detected significant biomarkers from both fMRI data and SNP data that are strongly correlated [7]. Parallel ICA is an effective method for the joint analysis of multiple modalities including interconnections between them [8]. Utilizing this method, Meda et al. detected three fMRI components significantly correlated with two distinct gene components in SCZ study [11]. In this study, a novel sparse representation based variable selection (SRVS) method was proposed and applied to an integrative analysis of two types of data: fMRI and SNP, aiming to obtain comprehensive analysis.

Sparse representation including compressive sensing has been widely used in signal/image processing and computational mathematics [1218]. Candes et al. showed that stable signal can be approximately recovered from incomplete and inaccurate measurements [14]. Wright et al. proposed a sparse representation based clustering (SRC) for face recognition, demonstrating high classification accuracy [15]. In our recent works [1618], we developed novel classification and feature selection algorithms based on sparse representation theory. We applied those methods to gene expression data analysis [16], to chromosome image classification [18], and to joint analysis of different data modalities (e.g. SNP data and gene expression data) [17], and achieved improved classification accuracies as well as better feature selections.

In applications of sparse representation, The availability of a limited number of samples is an important issue (e.g., feature selection and signal recovery) [19][20][21]. According to compressive sensing theory (e.g., the restricted isometry property (RIP) condition [23][24] for signal recovery), the number of available samples should not be less than the number of signals to be selected/recovered. However, the number of features/variables in genomic data (e.g. SNP data) or medical imaging data (e.g. fMRI data) are usually significantly big than the number of samples. In those cases, the traditional methods for compressive sampling cannot effectively analyse the data.

In a recent work, Li et al. [21] developed a voxel selection algorithm for fMRI data analysis. The method was based on sparse representation and is designed to get a sparse solution when sufficient samples exist. However, it may not handle the small sample problem described above.

In this study, a novel sparse representation based variable selection (SRVS) algorithm was proposed to select relevant biomarkers from big data sets having small sample sizes. The analysis was obtained by using a window based approach, whose size determines the resolution of the variable selection. We first tested the SRVS algorithm on a simulated data set (size of 100 × 1e6, with 50 cases and 50 controls), demonstrating the multi-resolution characteristic of the method. Then the algorithm was applied to an integrative analysis of two real data sets: a SNP data set (size of 208 × 759075) and a fMRI data set (size of 208 × 153594). Using the proposed SRVS algorithm, biomarkers for SCZ were identified and validated.

Methods

fMRI and SNP data collection

A total of 208 subjects, after signing informed consent, were recruited in the study, including 96 SCZ cases (age: 34 ± 11, 74 males) and 112 healthy controls (age: 32 ± 11, 68 males). Both SNP and fMRI data were collected from each of those 208 subjects. The healthy controls have no history of psychiatric disorders and were free of any medical. SCZ cases met the DSM-IV diagnostic criteria for schizophrenia. After pre-processing, 153594 fMRI voxels and 759075 SNP loci were obtained for the following biomarker selections. Please refer to [22] for detailed description of data collection and pre-processing.

Generalized sparse model

To combine different data sets for integrative analysis, we consider the following model:
y = [ α 1 X 1 , α 2 X 2 ] δ 1 δ 2 + ε = X δ + ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Equ1_HTML.gif
(1)

where y R n × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq1_HTML.gif is the phenotype vector of the subjects; matrix X 1 R n × p 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq2_HTML.gif and X 2 R n × p 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq3_HTML.gif represent data sets of different modalities having normalized column vectors (e.g., | | * | | 2 = 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq4_HTML.gif); X = [ α 1 X 1 , α 2 X 2 ] R n × p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq5_HTML.gif; α 1 + α 2 = 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq6_HTML.gif, and α 1 , α 2 > 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq7_HTML.gif are the weight factors for X 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq8_HTML.gif and X 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq9_HTML.gif respectively. The measurement error ε R n × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq10_HTML.gif. We aim to reconstruct the unknown sparse vector δ = δ 1 δ 2 R p × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq11_HTML.gif based on y https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq12_HTML.gif and X https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq13_HTML.gif, where δ 1 R p 1 × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq14_HTML.gif, δ 2 R p 2 × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq15_HTML.gif, and p 1 + p 2 = p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq16_HTML.gif.

It can be proven that when p > 35 n https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq17_HTML.gif, the matrix X R n × p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq18_HTML.gif has the difficulty to satisfy the restricted isometry property (RIP) condition [24] for signal recovery. In this work, p = 759075 + 153594 = 912669 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq19_HTML.gif and n = 208 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq20_HTML.gif. Thus p 35 n = 7280 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq21_HTML.gif. To overcome this problem, we propose the SRVS algorithm described as follows.

SRVS algorithm

To best approximate y https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq12_HTML.gif with the model given by Eq. (1), we consider the following L p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq22_HTML.gif minimization problem:
min | | δ | | p s u b j e c t t o | | y - X δ | | 2 ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Equ2_HTML.gif
(2)

where | | * | | 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq23_HTML.gif represents L p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq22_HTML.gif norm; p [ 0 , 1 ] https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq24_HTML.gif. The SRVS Algorithm given below is used to solve the L p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq22_HTML.gif minimization problem and select the phenotype relevant column vectors out of X https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq13_HTML.gif.

Spare representation base variable selection (SRVS) algorithm (http://​hongbaocao.​weebly.​com/​software-for-download.​html)

1. Initialize δ ( 0 ) = 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq25_HTML.gif;

2. For the l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq26_HTML.gif th step, randomly select X l R n × k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq27_HTML.gif from X = { x 1 , . . . , x p } R n × p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq28_HTML.gif; Mark the indexes of the columns in X l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq29_HTML.gif as I l R 1 × k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq30_HTML.gif;

3. Solve Eq. (3) to get δ l R k × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq31_HTML.gif:
min | | δ l | | p s . t . | | y - X l δ l | | 2 ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Equ3_HTML.gif
(3)

4. Update δ l R p × 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq32_HTML.gif with δ l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq33_HTML.gif: δ l ( I l ) = δ ( l - 1 ) ( I l ) + δ l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq34_HTML.gif; where δ l ( I l ) https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq35_HTML.gif and δ l - 1 ( I l ) https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq36_HTML.gif denote the I l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq37_HTML.gif th entries in δ l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq38_HTML.gif and δ l - 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq39_HTML.gif respectively;

5. If | | δ l / l - δ l - 1 / l - 1 | | 2 > α https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq40_HTML.gif, update l = l + 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq41_HTML.gif; go to Step 2.

6. Set δ = δ l / l https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq42_HTML.gif. The non-zero entries in δ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq43_HTML.gif correspond to the columns in X https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq13_HTML.gif to be selected.

In Step 3, we sought to solve a L 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq44_HTML.gif minimization problem using the OMP algorithm [19]. The OMP has been widely used for signal recovery and approximation [18], [2630].

It can be proven that, by using the SRVS algorithm, one can identify the significant variables with high probabilities. In addition, the SRVS algorithm can be shown convergent for any given k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif and ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif, generating an effective solution for the sparse model specified by Eq. (2). In the following section, we discuss the sparsity control issue to determine the number of variables to be selected.

Sparsity control using k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif

In Step 2 of the SRVS Algorithm, we exploit Fisher-Yates Shuffling algorithm [31] with a window of length k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif to select X l R n × k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq27_HTML.gif from X R n × p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq18_HTML.gif. The length k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif determines the resolution of the SRVS algorithm. When k = p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq47_HTML.gif, the number of variables selected will be generally equal to the sample number n https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq48_HTML.gif[23]. The smaller the k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif, the more the variables selected, and those variables generally include the variables selected with bigger k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif, as shown in Figure 1. This multi-resolution property enables us to select different number of variables at different significance levels.
https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Fig1_HTML.jpg
Figure 1

Diagram for the sparsity control using k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif in SRVS method. p https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq49_HTML.gif is the total number of columns/variables. The results were generated with white noise simulation data set (size 100 × 1e6; 50 cases, 50 controls and 1e6 variables).

Further sparsity control using ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif

The parameter ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif given in Eq. (2) can be used for further sparsity control. The magnitudes of entries of δ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq43_HTML.gif reflect the significance of the corresponding columns of X https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq13_HTML.gif[21]. Thus, a threshold can be selected for δ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq43_HTML.gif using cross-validation [32]. Another way to determine a threshold is using the error term ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif (as shown in Figure 2), which reflects the residual of | | y - X δ | | https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq50_HTML.gif[20]. When ε = 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq51_HTML.gif, noises may be involved in the columns selected [20]. In this study, we set ε = τ | | y | | 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq52_HTML.gif. From Figure 2, we show that if the first 400 variables with amplitudes larger than 0.002 are selected (i.e. points (400, 0.002) on 'Regression coefficients' curve), it corresponds to the point (400, 0.4) on the 'Error term coefficient' curve; it indicates that with these 400 variables, the error term ε = 0 . 4 | | y | | 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq53_HTML.gif.
https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Fig2_HTML.jpg
Figure 2

Diagram for further sparsity control using ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif. ε = τ | | y | | 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq54_HTML.gif; the entries of δ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq43_HTML.gif were sorted in descending order by amplitude. The results were generated with white noise simulation data set of size 100 × 1e6 (50 cases and 50 controls) with k = 0 . 02 × 1 e 6 = 2 e 4 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq55_HTML.gif

Validation

To validate the variable selected using our proposed SRVS algorithm, we compared our selected SNPs and fMRI voxels with that of previous studies. In addition, we used the selected SNPs and fMRI voxels to identify SCZ patients from healthy controls with the sparse representation based classifier (SRC) [15][18]. Then a leave one out (LOO) cross-validation approach was carried out to evaluate the identification accuracy. We compared the classification results with that of Li et al.'s method [21]. Furthermore, we compared the results of using variables selected from one type of data and that of both types of data. We also studied the influences of selecting different number of variables.

Result

We applied our SRVS method with the sparse model given by Eq. (1) to an integrative analysis of SNP and fMRI data sets. The results were compared with that of Li et al.'s method under different weighting factors. We also discussed the sparsity control issues using k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif and ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif.

Variable selection with different weight factors

Sparse model given by Eq. (1) with different weight factors were solved by our proposed SRVS method and by Li et al.'s method, respectively, as shown in Figure 3. It can be seen that at the two ends ( α 1 = 0 . 3 or 0 . 6 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq56_HTML.gif), the variables were selected form one type of data.
https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Fig3_HTML.jpg
Figure 3

Variable selection with the sparse model using different methods. The 'Weight factor' in the plots refers to α 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq57_HTML.gif (range of [0.3, 0.6]; step length = 0.02). (a) SRVS method with L 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq44_HTML.gif norms (b) Li et al.'s SLR method

In each of the 16 trials given by Figure 3, we selected the top 200 biomarkers by our proposed SRVS method and by Li et al.'s method [21]. As shown in Figure 3, the weight factor has similar effects on the variable selection of the two methods. It was interesting to see that even though the number of SNPs was much larger than that of fMRI voxels (759075 vs. 153594), similar number of variables were selected from both data sets when weight factor α 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq57_HTML.gif for SNP data set was around 0.5 (0.46 for SRVS method with L 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq44_HTML.gif norms, and 0.47 for Li et al.'s method). This suggests that the two data sets may contain similar information for the SCZ case/control study.

Comparison with Li et al.'s method

We selected 200 variables (SNPs and fMRI voxels) in each trial by our proposed SRVS method and by Li's et al.'s method respectively, as shown in Figure 3. However, further study showed that the variables selected by the two methods were significantly different (overlap <10%) (see Figure 4). Thus it was necessary to validate and compare those different groups of variables selected. We first compared the selected SNPs and the corresponding genes with the publicly reported SCZ genes for both methods. Then we compared the brain regions identified using those two methods. In addition, we compared the classification accuracies using the variables selected by our proposed SRVS method and Li et al.'s method.
https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Fig4_HTML.jpg
Figure 4

Comparison of the variables (fMRI voxels/SNPs) selected in the 16 trails by two different methods.

When compared with the top genes reported (see 'Top 45 SCZ genes' in the Additional file 1). For the 16 trials with the top 200 variables selected in each trial, our proposed SRVS method and Li et al.'s method identified 4 different reported genes, as shown in Table 1. It should be noted that even though both methods can identify gene 'OPCML', they recognized the gene through different SNPs (SRVS is by 'rs3026883' and Li et al.'s method is by 'rs1745939').
Table 1

The comparison with the reported first 45 SCZ genes (http://​www.​szgene.​org/​default.​asp). The Index is the order of the specific gene in the top 45 reported genes list.

SRVS ( L 0 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq44_HTML.gif)

Li et al.'s method

Index

Genes

SNPs

Index

Genes

SNPs

6

PDE4B

rs10846559

1

PRSS16

rs13399561

26

NRG1

rs12097254

11

DAOA

rs16869700

35

PLXNA2

rs4811326

17

RPP21

rs1836942

37

OPCML

rs3026883

37

OPCML

rs1745939

The comparison of selected top SCZ genes by different methods. The Index is the order of the specific gene in the top 45 reported gene list.

To further compare the two methods at different sparsity level, we studied more top variables in each of the 16 trials. To reach this purpose, we set ε = 0 . 3 y 2 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq58_HTML.gif and k = 0 . 05 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq59_HTML.gif for SRVS method. For Li's method [21], the number of subjects selected in each run was one tenth of total number of subjects; and we set the threshold θ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq60_HTML.gif = 0.01(please refer to [21] for the meaning of θ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq60_HTML.gif). As a consequence, 500 to 800 variables (SNPs and fMRI voxels) were selected in each trial. In this case, our proposed method selected 20 reported genes. For Li et al.'s method, 14 reported genes were located, and 11 of the top 45 genes were identified by both methods [22]. However, the genes identified by the two methods have <10% overlaps. For the top 50 genes selected by the two methods, there was only one gene, CSMD1, was identified by both methods. We listed the top 50 genes and the corresponding SNPs chosen by the two methods in Additional file 2.

When comparing the fMRI voxels selected (follow the approach shown in Figure 3), we showed that the SRVS method were capable of selecting fMRI voxels that were clustered in specific regions, as shown in Figure 5 (a). Those voxels located within a same region will have high correlations with each other. Therefore the results indicate the capability of our proposed SRVS method in selecting significant biomarkers that are highly correlated. Further study showed that the brains regions selected by our proposed SRVS method were mostly reported being associated with SCZ [3335], including temporal lobe, lateral frontal lobe, occipital lobe, and motor cortex (see Table 2). However, Li et al.'s method tended to select voxels that were scattered over different brain regions (see Figure 5 (b)). Besides, the brain regions selected by those two methods were largely different from each other. Thus we used multivariate classification approach to evaluate the effectiveness of the variables selected by two methods.
https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Fig5_HTML.jpg
Figure 5

A comparison of the fMRI voxels selected by using the two different methods. (a) Voxels selected using SRVS method (b) Voxels selected using Li et al.'s method

Table 2

Main brain regions of selected voxels using SRVS method

Brain region

Left(L)/Rigth(R) aal

Selected voxels number

   Precuneus

L/R

51

   Precentral Gyrus

L/R

35

   Sub-Gyral

L/R

32

   Middle Frontal Gyrus

L/R

26

   Middle Temporal Gyrus

L

20

   Cuneus

R

17

   Culmen

L/R

16

   Paracentral Lobule

L

16

   Lentiform Nucleus

L/R

13

   Superior Temporal Gyrus

L/R

13

   Declive

L/R

13

   Cingulate Gyrus

*

13

   Postcentral Gyrus

R

9

   Medial Frontal Gyrus

R

7

   Superior Frontal Gyrus

R

7

   Anterior Cingulate

R

7

The main brain regions selected using SRVS method

Multivariate classification

In this study, a LOO cross validation was carried out to evaluate the classification accuracy. In each run of the LOO validation, one sample was used for testing while the rest ones were used for variable selection. Results were presented in Figure 6. We showed that our proposed SRVS algorithm provided significantly higher classification ratios (CRs) ( p - value < 1 e - 11 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq61_HTML.gif) for both the 200-selected-variable case and the 800-selected-variable case. However, using different number of top selected variables showed no significant differences for neither of the two methods (p-value > 0.1).
https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_Fig6_HTML.jpg
Figure 6

A comparison of the multivariate classification using two methods. (a) The classification accuracy of the two methods with different variables selected; (b) The box plots of the classification accuracy. The 'Weight factor' in the plots refers to α 1 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq57_HTML.gif, in the range of [0.3, 0.6]; step length = 0.02. (a) CR by using SRVS method (b) CR by using Li et al.'s method

From Figure 6 (a) we showed that the highest classification accuracy was achieved at the weight factor α 1 = 0 . 5 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq62_HTML.gif, where around equal sized SNPs and fMRI voxels were selected by the SRVS method. At the two ends ( α 1 = 0 . 3 or 0 . 6 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq56_HTML.gif), the classification accuracies were relatively lower. This suggests that using biomarkers from both types of data may lead to better identification accuracy.

Discussion

In this study, we introduced a novel sparse representation based variable selection (SRVS) method, and applied it to an integrative analysis of SNP data and fMRI data. In the case of medical imaging data (e.g. fMRI data) or genomic data (e.g. SNP data), the number of samples tend to be much less than the number of variables (e.g. fMRI voxles; SNP loci). As a consequence, many of those variables are correlated and cannot be identified by traditional sparse signal recovery methods. The proposed SRVS method can identify significant variables with high probability, regardless of the coherence conditions required for exact signal recovery in compressive sensing. For example, significant fMRI voxels functionally correlated (within neighbour brain regions) were identified simultaneously by using our proposed SRVS algorithms (see Figure 5 (a)). This manifests the capability of out proposed SRVS method in handling big data set with small sample sizes.

In addition, the proposed SRVS method can be generalized to integrate multiple data modalities for joint analysis and achieve comprehensive diagnosis. As can be seen from Figure 6 (a), the highest classification accuracy was achieved using approximately equal sized variables from both data sets, suggesting that using biomarkers from both types of data may lead to higher diagnosis accuracy.

Another advantage of the SRVS method is its multiple detection resolutions. By choosing different values of widow length k https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq45_HTML.gif one can select different number of variables at different significance level. Furthermore, the error term ε https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq46_HTML.gif can be used for further sparsity control of the solution δ https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq43_HTML.gif, selecting the most important variables. This multi-resolution characteristic of SRVS provides a flexible variable selection approach for big data sets.

When compared to the previous SCZ studies, our method effectively identified more reported SCZ genes than Li et al.'s method. Furthermore, most of the brain regions identified using our proposed SRVS method are previously reported as SCZ associated brain regions. When using the selected variable to identify SCZ patients from controls, our method generated significantly higher classification ratio than Li et al.'s method (Figure 5 (b), p - value < 1 e - 11 https://static-content.springer.com/image/art%3A10.1186%2F1755-8794-6-S3-S2/MediaObjects/12920_2013_Article_422_IEq61_HTML.gif). Those results demonstrated the effectiveness of our method.

Conclusions

Our proposed SRVS is effective in variable selection for complex disease as SCZ. The biomarkers selected generate better identification accuracy than that of Li et al.'s method. When combining information from fMRI data and SNP data for integrative analysis, higher identification accuracy can be achieved, demonstrating the advantage of the combined analysis.

Declarations

Acknowledgements

This work is partially supported by the NIH and NSF.

This work is based on "Bio marker identification for diagnosis of schizophrenia with integrated analysis of fMRI and SNPs ", by Hongbao Cao which appeared in Bioinformatics and Biomedicine (BIBM), 2012 IEEE International Conference on. © 2012 IEEE [22].

Declarations

The publication costs for this article were funded by the corresponding author.

This article has been published as part of BMC Medical Genomics Volume 6 Supplement 3, 2013: Selected articles from the IEEE International Conference on Bioinformatics and Biomedicine 2012: Medical Genomics. The full contents of the supplement are available online at http://​www.​biomedcentral.​com/​bmcmedgenomics/​supplements/​6/​S3.

Authors’ Affiliations

(1)
Unit on Statistical Genomics, NIMH/NIH
(2)
Department of Biomedical Engineering, Tulane University
(3)
Department of Biostatistics & Bioinformatics, Tulane University
(4)
The Mind Research Network
(5)
Department of Electrical and Computer Engineering at the University of New Mexico

References

  1. McGrath J, Saha S, Chant D, Welham J: Schizophrenia: a concise overview of incidence, prevalence, and mortality. Epidemiol Rev. 2008, 30: 67-76. 10.1093/epirev/mxn001.View ArticlePubMed
  2. Kordi-Tamandani DM, Vaziri S, Dahmardeh N, Torkamanzehi A: Evaluation of polymorphism, hypermethylation and expression pattern of CTLA4 gene in a sample of Iranian patients with schizophrenia. Mol Biol Rep. 2013, 40: 5123-5128. 10.1007/s11033-013-2614-3.View ArticlePubMed
  3. Shayevitz C, Cohen OS, Faraone SV, Glatt SJ: A re-review of the association between the NOTCH4 locus and schizophrenia. Am J Med Genet B Neuropsychiatr Genet. 2012, 159B (5): 477-83. 10.1002/ajmg.b.32050.View ArticlePubMed
  4. Chen Y, Tian L, Zhang F, Liu C, Lu T, Ruan Y, Wang L, Yan H, Yan J, Liu Q, Zhang H, Ma W, Yang J, Li K, Lv L, Zhang D, Yue W: Myosin Vb gene is associated with schizophrenia in Chinese Han population. Psychiatry Res. 2013, 207: 13-8. 10.1016/j.psychres.2013.02.026.View ArticlePubMed
  5. Meda SA, Bhattarai M, Morris NA, Astur RS, Calhoun VD, Mathalon DH, Kiehl KA, Pearlson GD: An fMRI study of working memory in first-degree unaffected relatives of schizophrenia patients. Schizophr Res. 2008, 104: 85-95. 10.1016/j.schres.2008.06.013.PubMed CentralView ArticlePubMed
  6. Szycik GR, Münte TF, Dillo W, Mohammadi B, Samii A, Emrich HM, Dietrich DE: Audiovisual integration of speech is disturbed in schizophrenia: an fMRI study. Schizophr Res. 2009, 110: 111-118. 10.1016/j.schres.2009.03.003.View ArticlePubMed
  7. Chen J, Calhoun VD, Pearlson GD, Ehrlich S, Turner JA, Ho BC, Wassink TH, Michael AM, Liu J: Multifaceted genomic risk for brain function in schizophrenia. NeuroImage. 2012, 61: 866-875. 10.1016/j.neuroimage.2012.03.022.PubMed CentralView ArticlePubMed
  8. Liu J, Ghassemi MM, Michael AM, Boutte D, Wells W, Perrone-Bizzozero N, Macciardi F, Mathalon DH, Ford JM, Potkin SG, Turner JA, Calhoun VD: An ICA with reference approach in identification of genetic variation and associated brain networks. Frontiers in Human Neuroscience. 2012, 6: 1-10.
  9. Yang H, Liu J, Sui J, Pearlson G, Calhoun VD: A Hybrid Machine Learning Method for Fusing fMRI and Genetic Data to Classify Schizophrenia. Frontiers in Human Neuroscience. 2010, 4: 1-9.View Article
  10. Meda SA, Jagannathan K, Gelernter J, Calhoun VD, Liu J, Stevens MC, Pearlson GD: A pilot multivariate parallel ICA study to investigate differential linkage between neural networks and genetic profiles in schizophrenia. NeuroImage. 2010, 53: 1007-1015. 10.1016/j.neuroimage.2009.11.052.PubMed CentralView ArticlePubMed
  11. Liu J, Pearlson G, Windemuth A, Ruano G, Perrone-Bizzozero NI, Calhoun V: Combining fMRI and SNP data to investigate connections between brain function and genetics using parallel ICA. Hum Brain Mapp. 2009, 30: 241-255. 10.1002/hbm.20508.PubMed CentralView ArticlePubMed
  12. Gribonval R, Nielsen M: Sparse decompositions in unions of bases. IEEE Trans Inf Theory. 2003, 49: 3320-3325. 10.1109/TIT.2003.820031.View Article
  13. Tropp JA, Gilbert AC, Muthukrishnan S, Strauss MJ: Improved sparse approximation over quasi-incoherent dictionaries. Proc 2003 IEEE Int Conf Image Process, Barcelona, Spain. 2003, 1: 137-140.
  14. Candes E, Romberg J, Tao T: Stable signal recovery from incomplete and inaccurate measurements. Comm On Pure and Applied Math. 2006, 59: 1207-1223. 10.1002/cpa.20124.View Article
  15. Wright J, Yang AY, Ganesh A, Sastry SS, Ma Y: Robust face recognition via sparse representation. IEEE Trans Pattern Anal Mach. 2009, 31: 210-227.View Article
  16. Tang W, Cao H, Duan J, Wang YP: A compressed sensing based approach for subtyping of leukemia from gene expression data. J Bioinform Comput Biol. 2011, 9: 631-645. 10.1142/S0219720011005689.PubMed CentralView ArticlePubMed
  17. Cao H, Duan J, Lin D, Wang YP: Sparse Representation Based Clustering for Integrated Analysis of Gene Copy Number Variation and Gene Expression Data. IJCA. 2012, 19: 131-138.
  18. Cao H, Deng HW, Li M, Wang YP: Classification of multicolor fluorescence in situ hybridization (M-FISH) images with sparse representation. IEEE Trans Nanobioscience. 2012, 11: 111-118.PubMed CentralView ArticlePubMed
  19. Donoho DL, Elad M, Temlyakov VN: Stable recovery of sparse overcomplete representations in the presence of noise. IEEE Transactions on Information Theory. 2006, 52: 6-18.View Article
  20. Cai T, Wang L: Orthogonal Matching Pursuit for Sparse Signal Recovery. IEEE Trans on Inf Theory. 2011, 57: 1-26.View Article
  21. Li Y, Namburi P, Yu Z, Guan C, Feng J, Gu Z: Voxel selection in FMRI data analysis based on sparse representation. IEEE Trans Biomed Eng. 2009, 56: 2439-2451.View ArticlePubMed
  22. Cao H, Duan J, Lin D, Calhoun V, Wang YP: Bio marker identification for diagnosis of schizophrenia with integrated analysis of fMRI and SNPs. Bioinformatics and Biomedicine (BIBM), 2012 IEEE International Conference on: 4-7 October 2012. 2012, 1-6. 10.1109/BIBM.2012.6392674.View Article
  23. Li YQ, Cichocki A, Amari S: Analysis of sparse representation and blind source separation. Neural Comput. 2004, 16: 1193-1234. 10.1162/089976604773717586.View ArticlePubMed
  24. Davenport M, Duarte M, Hegde C, Baraniuk R: Introduction to compressive sensing. Connexions Web site. 2011, Apr 10, [http://​cnx.​org/​content/​m37172/​1.​7/​]
  25. Donoho DL, Tsaig Y: Fast Solution of L1-Norm Minimization Problems When the Solution May Be Sparse. IEEE Trans on Information Theory. 2008, 54: 4789-4812.View Article
  26. Davis G, Mallat S, Avellaneda M: Greedy adaptive approximation. J Constr Approx. 1997, 13: 57-98. 10.1007/BF02678430.View Article
  27. Tropp JA: Greed is good: Algorithmic results for sparse approximation. IEEE Trans Inf Theory. 2004, 50: 2231-2242. 10.1109/TIT.2004.834793.View Article
  28. Tropp JA: Just relax: Convex programming methods for identifying sparse signals. IEEE Trans Inf Theory. 2006, 51: 1030-1051.View Article
  29. Barron A, Cohen A, Dahmen W, DeVore R: Approximation and learning by greedy algorithms. Ann Statist. 2008, 36: 64-94. 10.1214/009053607000000631.View Article
  30. Duan J, Soussen C, Brie D, Idier J, Wang YP: On LARS/homotopy equivalence conditions for over-determined LASSO. IEEE Signal Processing Letters. 2012, 19: 894-897.View Article
  31. Fisher RA, Yates F: Statistical tables for biological, agricultural and medical research. 1948, OCLC 14222135London: Oliver & Boyd, 26-27. 3
  32. Lee H, Lee DS, Kang H, Kim BN, Chung MK: Sparse brain network recovery under compressed sensing. IEEE TMI. 2011, 30: 1154-1165.
  33. Pascual-Leone A, Manoach DS, Birnbaum R: Goff DC Motor cortical excitability in schizophrenia. Biol Psychiatry. 2002, 52: 24-31. 10.1016/S0006-3223(02)01317-3.View ArticlePubMed
  34. Kumari V, Gray JA, Honey GD, Soni W, Bullmore ET, Williams SC, Ng VW, Vythelingum GN, Simmons A, Suckling J, Corr PJ, Sharma T: Procedural learning in schizophrenia: a functional magnetic resonance imaging investigation. Schizophrenia Research. 2002, 57: 97-107. 10.1016/S0920-9964(01)00270-5.View ArticlePubMed
  35. Onitsuka T, Shenton ME, Salisbury DF, Dickey CC, Kasai K, Toner SK, Frumin M, Kikinis R, Jolesz FA, McCarley RW: Middle and inferior temporal gyrus gray matter volume abnormalities in chronic schizophrenia: an MRI study. Am J Psychiatry. 2004, 161: 1603-11. 10.1176/appi.ajp.161.9.1603.PubMed CentralView ArticlePubMed

Copyright

© Cao et al.; licensee BioMed Central Ltd. 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://​creativecommons.​org/​licenses/​by/​2.​0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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.

Advertisement