Control of Gene Regulatory Networks Basin of Attractions with Batch Reinforcement Learning

Cyntia Eico Hayama Nishida, Anna Helena Reali Costa, R. Bianchi
{"title":"Control of Gene Regulatory Networks Basin of Attractions with Batch Reinforcement Learning","authors":"Cyntia Eico Hayama Nishida, Anna Helena Reali Costa, R. Bianchi","doi":"10.1109/BRACIS.2018.00030","DOIUrl":null,"url":null,"abstract":"Basin of attraction contains biological functions and channels cell behavior, so when a gene network is in an unhealthy basin it may cause diseases. Control techniques can support the design of therapies that promote the transition of a biological system from diseased to healthier basins. Most control methods first infer a gene network and then derive a control strategy to avoid diseased states. However, this approach is limited to few genes and may cause other diseases, as the biological side of the problem is not considered. While changing between basins may change a diseased biological function for a healthier one, state avoidance can change functions in an unexpected way. We propose to extend a batch reinforcement learning method FQI-Sarsa, to change basin of attractions in a partial observable network. Using a batch reinforcement learning technique avoids the most time consuming phases that are the inference and control of the gene network. Results demonstrate that our method, BOAFQI-Sarsa, is more effective than previous studies that do not consider basins in their computations.","PeriodicalId":405190,"journal":{"name":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 7th Brazilian Conference on Intelligent Systems (BRACIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRACIS.2018.00030","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Basin of attraction contains biological functions and channels cell behavior, so when a gene network is in an unhealthy basin it may cause diseases. Control techniques can support the design of therapies that promote the transition of a biological system from diseased to healthier basins. Most control methods first infer a gene network and then derive a control strategy to avoid diseased states. However, this approach is limited to few genes and may cause other diseases, as the biological side of the problem is not considered. While changing between basins may change a diseased biological function for a healthier one, state avoidance can change functions in an unexpected way. We propose to extend a batch reinforcement learning method FQI-Sarsa, to change basin of attractions in a partial observable network. Using a batch reinforcement learning technique avoids the most time consuming phases that are the inference and control of the gene network. Results demonstrate that our method, BOAFQI-Sarsa, is more effective than previous studies that do not consider basins in their computations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于批强化学习的基因调控网络吸引盆地控制
吸引力盆地包含生物功能并引导细胞行为,因此当基因网络处于不健康的盆地时,可能会导致疾病。控制技术可以支持设计促进生物系统从患病盆地向健康盆地过渡的疗法。大多数控制方法首先推断出基因网络,然后推导出控制策略以避免疾病状态。然而,这种方法仅限于少数基因,并可能导致其他疾病,因为没有考虑到问题的生物学方面。虽然在流域之间的变化可能会使患病的生物功能变为更健康的生物功能,但状态回避可以以意想不到的方式改变功能。我们提出扩展批强化学习方法FQI-Sarsa,以改变部分可观察网络中的吸引力盆地。使用批强化学习技术避免了基因网络的推理和控制这两个最耗时的阶段。结果表明,我们的方法(BOAFQI-Sarsa)比以往不考虑盆地的计算方法更有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Exploring the Data Using Extended Association Rule Network SPt: A Text Mining Process to Extract Relevant Areas from SW Documents to Exploratory Tests Gene Essentiality Prediction Using Topological Features From Metabolic Networks Bio-Inspired and Heuristic Methods Applied to a Benchmark of the Task Scheduling Problem A New Genetic Algorithm-Based Pruning Approach for Optimum-Path Forest
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1