Adaptive Elastic-Net Sparse Principal Component Analysis for Pathway Association Testing

被引:7
作者
Chen, Xi [1 ]
机构
[1] Vanderbilt Univ, Dept Biostat, Nashville, TN 37232 USA
关键词
gene expression; microarray; pathway analysis; sparse principal component analysis; GENE SET ENRICHMENT; SINGULAR-VALUE DECOMPOSITION; WIDE EXPRESSION DATA; MICROARRAY DATA; RECEPTOR; SELECTION; THERAPY; LASSO; GAMMA;
D O I
10.2202/1544-6115.1697
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
Pathway or gene set analysis has become an increasingly popular approach for analyzing high-throughput biological experiments such as microarray gene expression studies. The purpose of pathway analysis is to identify differentially expressed pathways associated with outcomes. Important challenges in pathway analysis are selecting a subset of genes contributing most to association with clinical phenotypes and conducting statistical tests of association for the pathways efficiently. We propose a two-stage analysis strategy: (1) extract latent variables representing activities within each pathway using a dimension reduction approach based on adaptive elastic-net sparse principal component analysis; (2) integrate the latent variables with the regression modeling framework to analyze studies with different types of outcomes such as binary, continuous or survival outcomes. Our proposed approach is computationally efficient. For each pathway, because the latent variables are estimated in an unsupervised fashion without using disease outcome information, in the sample label permutation testing procedure, the latent variables only need to be calculated once rather than for each permutation resample. Using both simulated and real datasets, we show our approach performed favorably when compared with five other currently available pathway testing methods.
引用
收藏
页数:22
相关论文
共 50 条
  • [41] Use of Sparse Principal Component Analysis (SPCA) for Fault Detection
    Gajjar, Shriram
    Kulahci, Murat
    Palazoglu, Ahmet
    IFAC PAPERSONLINE, 2016, 49 (07): : 693 - 698
  • [42] CUTTING PLANE GENERATION THROUGH SPARSE PRINCIPAL COMPONENT ANALYSIS
    Dey, Santanu S.
    Kazachkov, Aleksandr
    Lodi, Andrea
    Munoz, Gonzalo
    SIAM JOURNAL ON OPTIMIZATION, 2022, 32 (02) : 1319 - 1343
  • [43] WAVELET BASED SPARSE PRINCIPAL COMPONENT ANALYSIS FOR HYPERSPECTRAL DENOISING
    Rasti, Behnood
    Sveinsson, Johannes R.
    Ulfarsson, Magnus O.
    Sigurdsson, Jakob
    2013 5TH WORKSHOP ON HYPERSPECTRAL IMAGE AND SIGNAL PROCESSING: EVOLUTION IN REMOTE SENSING (WHISPERS), 2013,
  • [44] ANOMALOUS SUBGRAPH DETECTION VIA SPARSE PRINCIPAL COMPONENT ANALYSIS
    Singh, Navraj
    Miller, Benjamin A.
    Bliss, Nadya T.
    Wolfe, Patrick J.
    2011 IEEE STATISTICAL SIGNAL PROCESSING WORKSHOP (SSP), 2011, : 485 - 488
  • [45] Clustering and feature selection using sparse principal component analysis
    Luss, Ronny
    d'Aspremont, Alexandre
    OPTIMIZATION AND ENGINEERING, 2010, 11 (01) : 145 - 157
  • [46] Multi-step adaptive elastic-net: reducing false positives in high-dimensional variable selection
    Xiao, Nan
    Xu, Qing-Song
    JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2015, 85 (18) : 3755 - 3765
  • [47] Sparse Principal Component Analysis via Fractional Function Regularity
    Han, Xuanli
    Peng, Jigen
    Cui, Angang
    Zhao, Fujun
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2020, 2020
  • [48] Prediction of Stress Increase at Ultimate in Unbonded Tendons Using Sparse Principal Component Analysis
    Eric McKinney
    Minwoo Chang
    Marc Maguire
    Yan Sun
    International Journal of Concrete Structures and Materials, 2019, 13
  • [49] Least angle sparse principal component analysis for ultrahigh dimensional data
    Xie, Yifan
    Wang, Tianhui
    Kim, Junyoung
    Lee, Kyungsik
    Jeong, Myong K.
    ANNALS OF OPERATIONS RESEARCH, 2024,
  • [50] Projection algorithms for nonconvex minimization with application to sparse principal component analysis
    William W. Hager
    Dzung T. Phan
    Jiajie Zhu
    Journal of Global Optimization, 2016, 65 : 657 - 676