Identifying significant edges in graphical models of molecular networks

被引:129
|
作者
Scutari, Marco [1 ]
Nagarajan, Radhakrishnan [2 ]
机构
[1] UCL, Genet Inst, London WC1E 6BT, England
[2] Univ Kentucky, Coll Publ Hlth, Dept Biostat, Div Biomed Informat, Lexington, KY 40536 USA
基金
英国生物技术与生命科学研究理事会; 英国工程与自然科学研究理事会;
关键词
Graphical models; Bayesian networks; Model averaging; L-1; norm; Molecular networks; LEARNING BAYESIAN NETWORKS;
D O I
10.1016/j.artmed.2012.12.006
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Objective: Modelling the associations from high-throughput experimental molecular data has provided unprecedented insights into biological pathways and signalling mechanisms. Graphical models and networks have especially proven to be useful abstractions in this regard. Ad hoc thresholds are often used in conjunction with structure learning algorithms to determine significant associations. The present study overcomes this limitation by proposing a statistically motivated approach for identifying significant associations in a network. Methods and materials: A new method that identifies significant associations in graphical models by estimating the threshold minimising the L norm between the cumulative distribution function (CDF) of the observed edge confidences and those of its asymptotic counterpart is proposed. The effectiveness of the proposed method is demonstrated on popular synthetic data sets as well as publicly available experimental molecular data corresponding to gene and protein expression profiles. Results: The improved performance of the proposed approach is demonstrated across the synthetic data sets using sensitivity, specificity and accuracy as performance metrics. The results are also demonstrated across varying sample sizes and three different structure learning algorithms with widely varying assumptions. In all cases, the proposed approach has specificity and accuracy close to 1, while sensitivity increases linearly in the logarithm of the sample size. The estimated threshold systematically outperforms common ad hoc ones in terms of sensitivity while maintaining comparable levels of specificity and accuracy. Networks from experimental data sets are reconstructed accurately with respect to the results from the original papers. Conclusion: Current studies use structure learning algorithms in conjunction with ad hoc thresholds for identifying significant associations in graphical abstractions of biological pathways and signalling mechanisms. Such an ad hoc choice can have pronounced effect on attributing biological significance to the associations in the resulting network and possible downstream analysis. The statistically motivated approach presented in this study has been shown to outperform ad hoc thresholds and is expected to alleviate spurious conclusions of significant associations in such graphical abstractions. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:207 / 217
页数:11
相关论文
共 50 条
  • [1] Identifying significant edges via neighborhood information
    Zhao, Na
    Li, Jie
    Wang, Jian
    Li, Tong
    Yu, Yong
    Zhou, Tao
    [J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 548
  • [2] Identifying critical edges in complex networks
    En-Yu Yu
    Duan-Bing Chen
    Jun-Yan Zhao
    [J]. Scientific Reports, 8
  • [3] Identifying critical edges in complex networks
    Yu, En-Yu
    Chen, Duan-Bing
    Zhao, Jun-Yan
    [J]. SCIENTIFIC REPORTS, 2018, 8
  • [4] Identifying oscillatory brain networks with hidden Gaussian graphical spectral models of MEEG
    Paz-Linares, Deirel
    Gonzalez-Moreira, Eduardo
    Areces-Gonzalez, Ariosky
    Wang, Ying
    Li, Min
    Martinez-Montes, Eduardo
    Bosch-Bayard, Jorge
    Bringas-Vega, Maria L.
    Valdes-Sosa, Mitchell
    Valdes-Sosa, Pedro A.
    [J]. SCIENTIFIC REPORTS, 2023, 13 (01)
  • [5] Identifying oscillatory brain networks with hidden Gaussian graphical spectral models of MEEG
    Deirel Paz-Linares
    Eduardo Gonzalez-Moreira
    Ariosky Areces-Gonzalez
    Ying Wang
    Min Li
    Eduardo Martinez-Montes
    Jorge Bosch-Bayard
    Maria L. Bringas-Vega
    Mitchell Valdes-Sosa
    Pedro A. Valdes-Sosa
    [J]. Scientific Reports, 13
  • [6] Identifying statistically significant edges in one-mode projections
    Neal Z.
    [J]. Social Network Analysis and Mining, 2013, 3 (4) : 915 - 924
  • [7] Factorial graphical models for dynamic networks
    Wit, Ernst
    Abbruzzo, Antonino
    [J]. NETWORK SCIENCE, 2015, 3 (01) : 37 - 57
  • [8] Random networks, graphical models and exchangeability
    Lauritzen, Steffen
    Rinaldo, Alessandro
    Sadeghi, Kayvan
    [J]. JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2018, 80 (03) : 481 - 508
  • [9] Duality of graphical models and tensor networks
    Robeva, Elina
    Seigal, Anna
    [J]. INFORMATION AND INFERENCE-A JOURNAL OF THE IMA, 2019, 8 (02) : 273 - 288
  • [10] Learning linear non-Gaussian graphical models with multidirected edges
    Liu, Yiheng
    Robeva, Elina
    Wang, Huanqing
    [J]. JOURNAL OF CAUSAL INFERENCE, 2021, 9 (01) : 250 - 263