利用多步建议分布改进贝叶斯网络结构学习中的MCMC收敛性。

EURASIP journal on bioinformatics & systems biology Pub Date : 2015-06-20 eCollection Date: 2015-12-01 DOI:10.1186/s13637-015-0024-7
Antti Larjo, Harri Lähdesmäki
{"title":"利用多步建议分布改进贝叶斯网络结构学习中的MCMC收敛性。","authors":"Antti Larjo,&nbsp;Harri Lähdesmäki","doi":"10.1186/s13637-015-0024-7","DOIUrl":null,"url":null,"abstract":"<p><p>Bayesian networks have become popular for modeling probabilistic relationships between entities. As their structure can also be given a causal interpretation about the studied system, they can be used to learn, for example, regulatory relationships of genes or proteins in biological networks and pathways. Inference of the Bayesian network structure is complicated by the size of the model structure space, necessitating the use of optimization methods or sampling techniques, such Markov Chain Monte Carlo (MCMC) methods. However, convergence of MCMC chains is in many cases slow and can become even a harder issue as the dataset size grows. We show here how to improve convergence in the Bayesian network structure space by using an adjustable proposal distribution with the possibility to propose a wide range of steps in the structure space, and demonstrate improved network structure inference by analyzing phosphoprotein data from the human primary T cell signaling network.</p>","PeriodicalId":72957,"journal":{"name":"EURASIP journal on bioinformatics & systems biology","volume":"2015 ","pages":"6"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13637-015-0024-7","citationCount":"9","resultStr":"{\"title\":\"Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.\",\"authors\":\"Antti Larjo,&nbsp;Harri Lähdesmäki\",\"doi\":\"10.1186/s13637-015-0024-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Bayesian networks have become popular for modeling probabilistic relationships between entities. As their structure can also be given a causal interpretation about the studied system, they can be used to learn, for example, regulatory relationships of genes or proteins in biological networks and pathways. Inference of the Bayesian network structure is complicated by the size of the model structure space, necessitating the use of optimization methods or sampling techniques, such Markov Chain Monte Carlo (MCMC) methods. However, convergence of MCMC chains is in many cases slow and can become even a harder issue as the dataset size grows. We show here how to improve convergence in the Bayesian network structure space by using an adjustable proposal distribution with the possibility to propose a wide range of steps in the structure space, and demonstrate improved network structure inference by analyzing phosphoprotein data from the human primary T cell signaling network.</p>\",\"PeriodicalId\":72957,\"journal\":{\"name\":\"EURASIP journal on bioinformatics & systems biology\",\"volume\":\"2015 \",\"pages\":\"6\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1186/s13637-015-0024-7\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURASIP journal on bioinformatics & systems biology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/s13637-015-0024-7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2015/12/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURASIP journal on bioinformatics & systems biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s13637-015-0024-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2015/12/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

贝叶斯网络在实体之间的概率关系建模方面已经变得非常流行。由于它们的结构也可以给出所研究系统的因果解释,因此它们可以用于学习,例如,生物网络和途径中基因或蛋白质的调节关系。贝叶斯网络结构的推断因模型结构空间的大小而变得复杂,需要使用优化方法或抽样技术,如马尔可夫链蒙特卡罗(MCMC)方法。然而,MCMC链的收敛在许多情况下是缓慢的,并且随着数据集大小的增长可能会成为一个更难的问题。我们在这里展示了如何通过使用可调节的建议分布来提高贝叶斯网络结构空间的收敛性,该分布可以在结构空间中提出大范围的步骤,并通过分析来自人类原代T细胞信号网络的磷酸化蛋白数据来证明改进的网络结构推断。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.

Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.

Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.

Using multi-step proposal distribution for improved MCMC convergence in Bayesian network structure learning.

Bayesian networks have become popular for modeling probabilistic relationships between entities. As their structure can also be given a causal interpretation about the studied system, they can be used to learn, for example, regulatory relationships of genes or proteins in biological networks and pathways. Inference of the Bayesian network structure is complicated by the size of the model structure space, necessitating the use of optimization methods or sampling techniques, such Markov Chain Monte Carlo (MCMC) methods. However, convergence of MCMC chains is in many cases slow and can become even a harder issue as the dataset size grows. We show here how to improve convergence in the Bayesian network structure space by using an adjustable proposal distribution with the possibility to propose a wide range of steps in the structure space, and demonstrate improved network structure inference by analyzing phosphoprotein data from the human primary T cell signaling network.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信