A two-step method for estimating high-dimensional Gaussian graphical models

被引:2
|
作者
Yang, Yuehan [1 ]
Zhu, Ji [2 ]
机构
[1] Cent Univ Finance & Econ, Sch Math & Stat, Beijing 100081, Peoples R China
[2] Univ Michigan, Dept Stat, Ann Arbor, MI 48109 USA
基金
中国国家自然科学基金;
关键词
covariance estimation; graphical model; penalized likelihood; sparse regression; two-step method; GENE-EXPRESSION SIGNATURE; COVARIANCE ESTIMATION; BREAST-CANCER; CONFIDENCE-INTERVALS; VARIABLE SELECTION; ASSOCIATION; LIKELIHOOD; REGRESSION; SURVIVAL; REGIONS;
D O I
10.1007/s11425-017-9438-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The problem of estimating high-dimensional Gaussian graphical models has gained much attention in recent years. Most existing methods can be considered as one-step approaches, being either regression-based or likelihood-based. In this paper, we propose a two-step method for estimating the high-dimensional Gaussian graphical model. Specifically, the first step serves as a screening step, in which many entries of the concentration matrix are identified as zeros and thus removed from further consideration. Then in the second step, we focus on the remaining entries of the concentration matrix and perform selection and estimation for nonzero entries of the concentration matrix. Since the dimension of the parameter space is effectively reduced by the screening step, the estimation accuracy of the estimated concentration matrix can be potentially improved. We show that the proposed method enjoys desirable asymptotic properties. Numerical comparisons of the proposed method with several existing methods indicate that the proposed method works well. We also apply the proposed method to a breast cancer microarray data set and obtain some biologically meaningful results.
引用
收藏
页码:1203 / 1218
页数:16
相关论文
共 50 条
  • [41] Fast Classification Rates for High-dimensional Gaussian Generative Models
    Li, Tianyang
    Prasad, Adarsh
    Ravikumar, Pradeep
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 28 (NIPS 2015), 2015, 28
  • [42] Regularized Parameter Estimation in High-Dimensional Gaussian Mixture Models
    Ruan, Lingyan
    Yuan, Ming
    Zou, Hui
    [J]. NEURAL COMPUTATION, 2011, 23 (06) : 1605 - 1622
  • [43] Gaussian Variational Approximations for High-dimensional State Space Models
    Quiroz, Matias
    Nott, David J.
    Kohn, Robert
    [J]. BAYESIAN ANALYSIS, 2023, 18 (03): : 989 - 1016
  • [44] Estimation of high-dimensional graphical models using regularized score matching
    Lin, Lina
    Drton, Mathias
    Shojaie, Ali
    [J]. ELECTRONIC JOURNAL OF STATISTICS, 2016, 10 (01): : 806 - 854
  • [45] Inference and Verification of Probabilistic Graphical Models from High-Dimensional Data
    Ma, Yinjiao
    Damazyn, Kevin
    Klinger, Jakob
    Gong, Haijun
    [J]. DATA INTEGRATION IN THE LIFE SCIENCES, DILS 2015, 2015, 9162 : 223 - 239
  • [46] IDENTIFYING CORRELATED COMPONENTS IN HIGH-DIMENSIONAL MULTIVARIATE GAUSSIAN MODELS
    Geng, Jun
    Xu, Weiyu
    Lai, Lifeng
    [J]. 2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 6424 - 6428
  • [47] CLASSIFICATION OF HIGH-DIMENSIONAL MICROARRAY DATA WITH A TWO-STEP PROCEDURE VIA A WILCOXON CRITERION AND MULTILAYER PERCEPTRON
    Nikulin, Vladimir
    Huang, Tian-Hsiang
    Mclachlan, Geoffrey
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2011, 10 (01) : 1 - 14
  • [48] Graphical Comparison of High-Dimensional Distributions
    Modarres, Reza
    [J]. INTERNATIONAL STATISTICAL REVIEW, 2020, 88 (03) : 698 - 714
  • [49] High-Dimensional gaussian graphical model selection: Walk summability and local separation criterion
    Anandkumar, Animashree
    Tan, Vincent Y.F.
    Huang, Furong
    Willsky, Alan S.
    [J]. Journal of Machine Learning Research, 2012, 13 : 2293 - 2337
  • [50] High-Dimensional Gaussian Graphical Model Selection: Walk Summability and Local Separation Criterion
    Anandkumar, Animashree
    Tan, Vincent Y. F.
    Huang, Furong
    Willsky, Alan S.
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2012, 13 : 2293 - 2337