{"title":"互信息引导下MCMC采样器调节网络的推理","authors":"Nilzair M. Barreto, K. Machado, A. Werhli","doi":"10.1145/3019612.3022189","DOIUrl":null,"url":null,"abstract":"Computationally efficient and exact inference of regulatory network topology is an open problem in System Biology. In this work we investigate the use of prior information about the network topology as a guide to a Markov Chain Monte Carlo sampler of network structures. The prior information is obtained from a coarser and faster network inference method, the Relevance Networks with Mutual Information scores. Moreover, the regulatory networks are represented by the Bayesian Networks model. The results show that the use of prior information drastically improves the convergence of the MCMC sampler. Therefore, the use of a more refined method is justified as it is likely to lead to more reliable results with less MCMC iterations.","PeriodicalId":20728,"journal":{"name":"Proceedings of the Symposium on Applied Computing","volume":"65 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2017-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Inference of regulatory networks with MCMC sampler guided by mutual information\",\"authors\":\"Nilzair M. Barreto, K. Machado, A. Werhli\",\"doi\":\"10.1145/3019612.3022189\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Computationally efficient and exact inference of regulatory network topology is an open problem in System Biology. In this work we investigate the use of prior information about the network topology as a guide to a Markov Chain Monte Carlo sampler of network structures. The prior information is obtained from a coarser and faster network inference method, the Relevance Networks with Mutual Information scores. Moreover, the regulatory networks are represented by the Bayesian Networks model. The results show that the use of prior information drastically improves the convergence of the MCMC sampler. Therefore, the use of a more refined method is justified as it is likely to lead to more reliable results with less MCMC iterations.\",\"PeriodicalId\":20728,\"journal\":{\"name\":\"Proceedings of the Symposium on Applied Computing\",\"volume\":\"65 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Symposium on Applied Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3019612.3022189\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Symposium on Applied Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3019612.3022189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Inference of regulatory networks with MCMC sampler guided by mutual information
Computationally efficient and exact inference of regulatory network topology is an open problem in System Biology. In this work we investigate the use of prior information about the network topology as a guide to a Markov Chain Monte Carlo sampler of network structures. The prior information is obtained from a coarser and faster network inference method, the Relevance Networks with Mutual Information scores. Moreover, the regulatory networks are represented by the Bayesian Networks model. The results show that the use of prior information drastically improves the convergence of the MCMC sampler. Therefore, the use of a more refined method is justified as it is likely to lead to more reliable results with less MCMC iterations.