Accounting for network noise in graph-guided Bayesian modeling of structured high-dimensional data

Author:

Li Wenrui1ORCID,Chang Changgee2ORCID,Kundu Suprateek3,Long Qi1ORCID

Affiliation:

1. Department of Biostatistics, Epidemiology and Informatics, University of Pennsylvania , PA 19104 , United States

2. Department of Biostatistics and Health Data Science, Indiana University School of Medicine , Indianapolis, IN 46202 , United States

3. Department of Biostatistics, University of Texas MD Anderson Cancer Center , Houston, TX 77030 , United States

Abstract

Abstract There is a growing body of literature on knowledge-guided statistical learning methods for analysis of structured high-dimensional data (such as genomic and transcriptomic data) that can incorporate knowledge of underlying networks derived from functional genomics and functional proteomics. These methods have been shown to improve variable selection and prediction accuracy and yield more interpretable results. However, these methods typically use graphs extracted from existing databases or rely on subject matter expertise, which are known to be incomplete and may contain false edges. To address this gap, we propose a graph-guided Bayesian modeling framework to account for network noise in regression models involving structured high-dimensional predictors. Specifically, we use 2 sources of network information, including the noisy graph extracted from existing databases and the estimated graph from observed predictors in the dataset at hand, to inform the model for the true underlying network via a latent scale modeling framework. This model is coupled with the Bayesian regression model with structured high-dimensional predictors involving an adaptive structured shrinkage prior. We develop an efficient Markov chain Monte Carlo algorithm for posterior sampling. We demonstrate the advantages of our method over existing methods in simulations, and through analyses of a genomics dataset and another proteomics dataset for Alzheimer’s disease.

Funder

National Institutes of Health

National Institute of Mental Health

Publisher

Oxford University Press (OUP)

Reference40 articles.

1. Network sampling: from static to streaming graphs;Ahmed;ACM Transactions on Knowledge Discovery from Data (TKDD),2014

2. On the propagation of low-rate measurement error to subgraph counts in large networks;Balachandran;The Journal of Machine Learning Research,2017

3. Overview and findings from the religious orders study;Bennett;Current Alzheimer Research,2012

4. Scalable Bayesian variable selection for structured high-dimensional data;Chang;Biometrics,2018

5. Estimation of subgraph densities in noisy networks;Chang;Journal of the American Statistical Association,2022

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Knowledge-guided learning methods for integrative analysis of multi-omics data;Computational and Structural Biotechnology Journal;2024-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3