Folded concave penalized learning of high-dimensional MRI data in Parkinson's disease

被引:1
|
作者
Li, Changcheng [1 ]
Wang, Xue [2 ]
Du, Guangwei [3 ,5 ]
Chen, Hairong [3 ]
Brown, Gregory [3 ]
Lewis, Mechelle M. [3 ,4 ]
Yao, Tao [2 ]
Li, Runze [1 ]
Huang, Xuemei [3 ,4 ,5 ,6 ,7 ]
机构
[1] Penn State Univ, Dept Stat, University Pk, PA 16802 USA
[2] Alibaba DAMO Acad, Seattle, WA USA
[3] Penn State Hershey Med Ctr, Dept Neurol, Hershey, PA 17033 USA
[4] Penn State Hershey Med Ctr, Dept Pharmacol, Hershey, PA 17033 USA
[5] Penn State Hershey Med Ctr, Dept Radiol, Hershey, PA 17033 USA
[6] Penn State Hershey Med Ctr, Dept Neurosurg, Hershey, PA 17033 USA
[7] Penn State Hershey Med Ctr, Dept Kinesiol, Hershey, PA 17033 USA
基金
美国国家科学基金会;
关键词
Magnetic resonance imaging; Diffusion tensor imaging; Folded concave penalized learning; Support vector machine; Logistic regression; LOGISTIC-REGRESSION; VARIABLE SELECTION; MODEL SELECTION; LASSO; SPARSITY; LIKELIHOOD; RECOVERY; CLASSIFICATION; REGISTRATION; THICKNESS;
D O I
10.1016/j.jneumeth.2021.109157
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: Brain MRI is a promising technique for Parkinson's disease (PD) biomarker development. Its analysis, however, is hindered by the high-dimensional nature of the data, particularly when the sample size is relatively small. New Method: This study introduces a folded concave penalized machine learning scheme with spatial coupling fused penalty (fused FCP) to build biomarkers for PD directly from whole-brain voxel-wise MRI data. The penalized maximum likelihood estimation problem of the model is solved by local linear approximation. Results: The proposed approach is evaluated on synthetic and Parkinson's Progression Marker Initiative (PPMI) data. It achieves good AUC scores, accuracy in classification, and biomarker identification with a relatively small sample size, and the results are robust for different tuning parameter choices. On the PPMI data, the proposed method discovers over 80 % of large regions of interest (ROIs) identified by the voxel-wise method, as well as potential new ROIs. Comparison with Existing Methods: The fused FCP approach is compared with L1, fused-L1, and FCP method using three popular machine learning algorithms, logistic regression, support vector machine, and linear discriminant analysis, as well as the voxel-wise method, on both synthetic and PPMI datasets. The fused FCP method demonstrated better accuracy in separating PD from controls than L1 and fused-L1 methods, and similar performance when compared with FCP method. In addition, the fused FCP method showed better ROI identification. Conclusions: The fused FCP method can be an effective approach for MRI biomarker discovery in PD and other studies using high dimensionality data/low sample sizes.
引用
收藏
页数:14
相关论文
共 50 条
  • [31] Metric Learning for High-Dimensional Tensor Data
    Shi Jiarong
    Jiao Licheng
    Shang Fanhua
    CHINESE JOURNAL OF ELECTRONICS, 2011, 20 (03): : 495 - 498
  • [32] Similarity Learning for High-Dimensional Sparse Data
    Liu, Kuan
    Bellet, Aurelien
    Sha, Fei
    ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 38, 2015, 38 : 653 - 662
  • [33] Group Learning for High-Dimensional Sparse Data
    Cherkassky, Vladimir
    Chen, Hsiang-Han
    Shiao, Han-Tai
    2019 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2019,
  • [34] AucPR: An AUC-based approach using penalized regression for disease prediction with high-dimensional omics data
    Yu, Wenbao
    Park, Taesung
    BMC GENOMICS, 2014, 15
  • [35] AucPR: An AUC-based approach using penalized regression for disease prediction with high-dimensional omics data
    Wenbao Yu
    Taesung Park
    BMC Genomics, 15
  • [36] Sparse Learning for Large-Scale and High-Dimensional Data: A Randomized Convex-Concave Optimization Approach
    Zhang, Lijun
    Yang, Tianbao
    Jin, Rong
    Zhou, Zhi-Hua
    ALGORITHMIC LEARNING THEORY, (ALT 2016), 2016, 9925 : 83 - 97
  • [37] PENALIZED LINEAR REGRESSION WITH HIGH-DIMENSIONAL PAIRWISE SCREENING
    Gong, Siliang
    Zhang, Kai
    Liu, Yufeng
    STATISTICA SINICA, 2021, 31 (01) : 391 - 420
  • [38] Penalized Independence Rule for Testing High-Dimensional Hypotheses
    Shen, Yanfeng
    Lin, Zhengyan
    Zhu, Jun
    COMMUNICATIONS IN STATISTICS-THEORY AND METHODS, 2011, 40 (13) : 2424 - 2435
  • [39] High-dimensional penalized Bernstein support vector classifier
    Kharoubi, Rachid
    Mkhadri, Abdallah
    Oualkacha, Karim
    COMPUTATIONAL STATISTICS, 2024, 39 (04) : 1909 - 1936
  • [40] ADMM for High-Dimensional Sparse Penalized Quantile Regression
    Gu, Yuwen
    Fan, Jun
    Kong, Lingchen
    Ma, Shiqian
    Zou, Hui
    TECHNOMETRICS, 2018, 60 (03) : 319 - 331