利用自然启发算法解决人类遗传学中的复杂问题需要利用领域特定知识的策略

C. Greene, J. Moore
{"title":"利用自然启发算法解决人类遗传学中的复杂问题需要利用领域特定知识的策略","authors":"C. Greene, J. Moore","doi":"10.4018/978-1-60566-705-8.ch007","DOIUrl":null,"url":null,"abstract":"In human genetics the availability of chip-based technology facilitates the measurement of thousands of DNA sequence variations from across the human genome. The informatics challenge is to identify combinations of interacting DNA sequence variations that predict common diseases. The authors review three nature-inspired methods that have been developed and evaluated in this domain. The two approaches this chapter focuses on in detail are genetic programming (GP) and a complex-system inspired GPlike computational evolution system (CES). The authors also discuss a third nature-inspired approach known as ant colony optimization (ACO). The GP and ACO techniques are designed to select relevant attributes, while the CES addresses both the selection of relevant attributes and the modeling of disease risk. Specifically, they examine these methods in the context of epistasis or gene-gene interactions. For the work discussed here we focus solely on the situation where there is an epistatic effect but no detectable main effect. In this domain, early studies show that nature-inspired algorithms perform no better than a simple random search when classification accuracy is used as the fitness function. Thus, the challenge for applying these search algorithms to this problem is that when using classification accuracy there are no building blocks. The goal then is to use outside knowledge or pre-processing of the dataset to provide these building blocks in a manner that enables the population, in a nature-inspired framework,","PeriodicalId":222582,"journal":{"name":"Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Solving Complex Problems in Human Genetics using Nature-Inspired Algorithms Requires Strategies which Exploit Domain-Specific Knowledge\",\"authors\":\"C. Greene, J. Moore\",\"doi\":\"10.4018/978-1-60566-705-8.ch007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In human genetics the availability of chip-based technology facilitates the measurement of thousands of DNA sequence variations from across the human genome. The informatics challenge is to identify combinations of interacting DNA sequence variations that predict common diseases. The authors review three nature-inspired methods that have been developed and evaluated in this domain. The two approaches this chapter focuses on in detail are genetic programming (GP) and a complex-system inspired GPlike computational evolution system (CES). The authors also discuss a third nature-inspired approach known as ant colony optimization (ACO). The GP and ACO techniques are designed to select relevant attributes, while the CES addresses both the selection of relevant attributes and the modeling of disease risk. Specifically, they examine these methods in the context of epistasis or gene-gene interactions. For the work discussed here we focus solely on the situation where there is an epistatic effect but no detectable main effect. In this domain, early studies show that nature-inspired algorithms perform no better than a simple random search when classification accuracy is used as the fitness function. Thus, the challenge for applying these search algorithms to this problem is that when using classification accuracy there are no building blocks. The goal then is to use outside knowledge or pre-processing of the dataset to provide these building blocks in a manner that enables the population, in a nature-inspired framework,\",\"PeriodicalId\":222582,\"journal\":{\"name\":\"Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/978-1-60566-705-8.ch007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Nature-Inspired Informatics for Intelligent Applications and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/978-1-60566-705-8.ch007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

在人类遗传学中,基于芯片的技术的可用性有助于测量来自整个人类基因组的数千个DNA序列变异。信息学的挑战是确定预测常见疾病的相互作用DNA序列变异的组合。作者回顾了在这个领域已经开发和评估的三种自然启发的方法。本章详细讨论的两种方法是遗传规划(GP)和复杂系统启发的gpllike计算进化系统(CES)。作者还讨论了第三种受自然启发的方法,即蚁群优化(ACO)。GP和ACO技术旨在选择相关属性,而CES既解决相关属性的选择问题,也解决疾病风险建模问题。具体来说,他们在上位性或基因-基因相互作用的背景下检查这些方法。对于这里讨论的工作,我们只关注有上位效应但没有可检测到的主效应的情况。在这个领域,早期的研究表明,当分类精度作为适应度函数时,受自然启发的算法并不比简单的随机搜索更好。因此,将这些搜索算法应用于这个问题的挑战是,当使用分类准确性时,没有构建块。然后,目标是使用外部知识或数据集的预处理,以某种方式提供这些构建块,使人口在自然启发的框架中,
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Solving Complex Problems in Human Genetics using Nature-Inspired Algorithms Requires Strategies which Exploit Domain-Specific Knowledge
In human genetics the availability of chip-based technology facilitates the measurement of thousands of DNA sequence variations from across the human genome. The informatics challenge is to identify combinations of interacting DNA sequence variations that predict common diseases. The authors review three nature-inspired methods that have been developed and evaluated in this domain. The two approaches this chapter focuses on in detail are genetic programming (GP) and a complex-system inspired GPlike computational evolution system (CES). The authors also discuss a third nature-inspired approach known as ant colony optimization (ACO). The GP and ACO techniques are designed to select relevant attributes, while the CES addresses both the selection of relevant attributes and the modeling of disease risk. Specifically, they examine these methods in the context of epistasis or gene-gene interactions. For the work discussed here we focus solely on the situation where there is an epistatic effect but no detectable main effect. In this domain, early studies show that nature-inspired algorithms perform no better than a simple random search when classification accuracy is used as the fitness function. Thus, the challenge for applying these search algorithms to this problem is that when using classification accuracy there are no building blocks. The goal then is to use outside knowledge or pre-processing of the dataset to provide these building blocks in a manner that enables the population, in a nature-inspired framework,
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Nature-Inspired Informatics for Telecommunication Network Design Neural Networks in Medicine An Artificial Life-Based Vegetation Modelling Approach for Biodiversity Research Modelling Biological Processes Naturally using Systemic Computation Combinational Circuit Design with Estimation of Distribution Algorithms
×
引用
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