Constructing metabolic association networks using high-dimensional mass spectrometry data

被引:0
|
作者
Koo, Imhoi [1 ]
Wei, Xiaoli [1 ]
Shi, Xue [1 ]
Zhou, Zhanxiang [2 ]
Kim, Seongho [3 ]
Zhang, Xiang [1 ]
机构
[1] Univ Louisville, Dept Chem, Ctr Regulatory & Environm Analyt Metabol, Louisville, KY 40292 USA
[2] Univ N Carolina, Dept Nutr, Greensboro, NC 27412 USA
[3] Wayne State Univ, Sch Med, Dept Oncol, Biostat Core,Karmanos Canc Inst, Detroit, MI 48201 USA
基金
美国国家科学基金会;
关键词
Metabolomics; Gaussian graphical model; Partial correlation; Independent component regression; Principal component regression; Partial least squares regression; Extrinsic similarity; PARTIAL LEAST-SQUARES; INDEPENDENT COMPONENT ANALYSIS; REDUCTION;
D O I
10.1016/j.chemolab.2014.07.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The goal of metabolic association networks is to identify topology of a metabolic network for a better understanding of molecular mechanisms. An accurate metabolic association network enables investigation of the functional behavior of metabolites in a cell or tissue. Gaussian Graphical model (GGM)-based methods have been widely used in genomics to infer biological networks. However, the performance of various GGM-based methods for the construction of metabolic association networks remains unknown in metabolomics. The performance of principal component regression (PCR), independent component regression (ICR), shrinkage covariance estimate (SCE), partial least squares regression (PLSR), and extrinsic similarity (ES) methods in constructing metabolic association networks was compared by estimating partial correlation coefficient matrices when the number of variables is larger than the sample size. To do this, the sample size and the network density (complexity) were considered as variables for network construction. Simulation studies show that PCR and ICR are more stable to the sample size and the network density than SCE and PLSR in terms of F1 scores. These methods were further applied to the analysis of experimental metabolomics data acquired from metabolite extract of mouse liver. For the simulated data, the proposed methods PCR and ICR outperform other methods when the network density is large, while PLSR and SCE perform better when the network density is small. As for the experimental metabolomics data, PCR and ICR discover more significant edges and perform better than PLSR and SCE when the discovered edges are evaluated using KEGG pathway. These results suggest that the metabolic network might be more complex and therefore, PCR and ICR have the advantage over PLSR and SCE in constructing the metabolic association networks. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:193 / 202
页数:10
相关论文
共 50 条
  • [21] High-dimensional data
    Amaratunga, Dhammika
    Cabrera, Javier
    JOURNAL OF THE NATIONAL SCIENCE FOUNDATION OF SRI LANKA, 2016, 44 (01): : 3 - 9
  • [22] A preliminary study on constructing a high-dimensional asynchronous spectrum to analyze bilinear data
    Guo, Ran
    Zhang, Xin
    Zhang, Fei
    Zhang, Zhuo-yong
    Yu, Zhen-qiang
    Xu, Yi-zhuang
    Noda, Isao
    Ozaki, Yukihiro
    SPECTROCHIMICA ACTA PART A-MOLECULAR AND BIOMOLECULAR SPECTROSCOPY, 2019, 216 : 76 - 84
  • [23] STARM: STreaming Association Rules Mining in High-Dimensional Data
    Gahar, Rania Mkhinini
    Arfaoui, Olfa
    Hidri, Adel
    Alsaif, Suleiman Ali
    Hidri, Minyar Sassi
    ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 2, AINA 2024, 2024, 200 : 136 - 146
  • [24] Functional Neural Networks for High-Dimensional Genetic Data Analysis
    Zhang, Shan
    Zhou, Yuan
    Geng, Pei
    Lu, Qing
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2024, 21 (03) : 383 - 393
  • [25] Inferring Networks from High-Dimensional Data with Mixed Variables
    Abbruzzo, Antonino
    Mineo, Angelo M.
    ADVANCES IN COMPLEX DATA MODELING AND COMPUTATIONAL METHODS IN STATISTICS, 2015, : 1 - 15
  • [26] On the challenges of learning with inference networks on sparse, high-dimensional data
    Krishnan, Rahul G.
    Liang, Dawen
    Hoffman, Matthew D.
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 84, 2018, 84
  • [27] Sparsistent filtering of comovement networks from high-dimensional data
    Chakrabarti, Arnab
    Chakrabarti, Anindya S.
    JOURNAL OF COMPUTATIONAL SCIENCE, 2022, 65
  • [28] Learning Gene Regulatory Networks with High-Dimensional Heterogeneous Data
    Jia, Bochao
    Liang, Faming
    NEW FRONTIERS OF BIOSTATISTICS AND BIOINFORMATICS, 2018, : 305 - 327
  • [29] Probabilistic Data-Driven Prediction of Wellbore Signatures in High-Dimensional Data Using Bayesian Networks
    Bassamzadeh, Nastaran
    Ghanem, Roger
    SPE JOURNAL, 2018, 23 (04): : 1090 - 1104
  • [30] High-dimensional Apollonian networks
    Zhang, ZZ
    Comellas, F
    Fertin, G
    Rong, LL
    JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 2006, 39 (08): : 1811 - 1818