清晨好,您是今天最早来到科研通的研友!由于当前在线用户较少,发布求助请尽量完整的填写文献信息,科研通机器人24小时在线,伴您科研之路漫漫前行!

Hybrid Harris hawks optimization with cuckoo search for drug design and discovery in chemoinformatics.

药物发现 化学空间 搜索算法
作者
Essam H. Houssein,Mosa E. Hosney,Mohamed Elhoseny,Diego Oliva,Waleed M. Mohamed,Mahmoud Hassaballah
出处
期刊:Scientific Reports [Springer Nature]
卷期号:10 (1): 14439- 被引量:22
标识
DOI:10.1038/s41598-020-71502-z
摘要

One of the major drawbacks of cheminformatics is a large amount of information present in the datasets. In the majority of cases, this information contains redundant instances that affect the analysis of similarity measurements with respect to drug design and discovery. Therefore, using classical methods such as the protein bank database and quantum mechanical calculations are insufficient owing to the dimensionality of search spaces. In this paper, we introduce a hybrid metaheuristic algorithm called CHHO-CS, which combines Harris hawks optimizer (HHO) with two operators: cuckoo search (CS) and chaotic maps. The role of CS is to control the main position vectors of the HHO algorithm to maintain the balance between exploitation and exploration phases, while the chaotic maps are used to update the control energy parameters to avoid falling into local optimum and premature convergence. Feature selection (FS) is a tool that permits to reduce the dimensionality of the dataset by removing redundant and non desired information, then FS is very helpful in cheminformatics. FS methods employ a classifier that permits to identify the best subset of features. The support vector machines (SVMs) are then used by the proposed CHHO-CS as an objective function for the classification process in FS. The CHHO-CS-SVM is tested in the selection of appropriate chemical descriptors and compound activities. Various datasets are used to validate the efficiency of the proposed CHHO-CS-SVM approach including ten from the UCI machine learning repository. Additionally, two chemical datasets (i.e., quantitative structure-activity relation biodegradation and monoamine oxidase) were utilized for selecting the most significant chemical descriptors and chemical compounds activities. The extensive experimental and statistical analyses exhibit that the suggested CHHO-CS method accomplished much-preferred trade-off solutions over the competitor algorithms including the HHO, CS, particle swarm optimization, moth-flame optimization, grey wolf optimizer, Salp swarm algorithm, and sine-cosine algorithm surfaced in the literature. The experimental results proved that the complexity associated with cheminformatics can be handled using chaotic maps and hybridizing the meta-heuristic methods.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
9494完成签到,获得积分10
35秒前
忧郁静白完成签到 ,获得积分20
1分钟前
1分钟前
1分钟前
mzhang2完成签到 ,获得积分10
1分钟前
1分钟前
Emperor完成签到 ,获得积分0
1分钟前
合适的寄灵完成签到 ,获得积分10
2分钟前
朴素的山蝶完成签到 ,获得积分10
2分钟前
2分钟前
李爱国应助科研通管家采纳,获得10
2分钟前
Drwenlu完成签到,获得积分10
3分钟前
3分钟前
习月阳完成签到,获得积分10
3分钟前
领导范儿应助帮帮我好吗采纳,获得10
3分钟前
3分钟前
baobeikk完成签到,获得积分10
4分钟前
4分钟前
充电宝应助帮帮我好吗采纳,获得10
4分钟前
Migue发布了新的文献求助10
4分钟前
Qiancheni完成签到,获得积分10
4分钟前
Ava应助帮帮我好吗采纳,获得10
5分钟前
5分钟前
5分钟前
wangfaqing942完成签到 ,获得积分10
5分钟前
6分钟前
NexusExplorer应助帮帮我好吗采纳,获得10
6分钟前
6分钟前
FashionBoy应助科研通管家采纳,获得10
6分钟前
科研通AI2S应助帮帮我好吗采纳,获得10
7分钟前
7分钟前
8分钟前
8分钟前
8分钟前
vitamin完成签到 ,获得积分10
8分钟前
8分钟前
8分钟前
文艺的初南完成签到 ,获得积分10
8分钟前
8分钟前
xun完成签到,获得积分10
9分钟前
高分求助中
Sustainability in Tides Chemistry 2800
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
Rechtsphilosophie 1000
Bayesian Models of Cognition:Reverse Engineering the Mind 888
Defense against predation 800
Very-high-order BVD Schemes Using β-variable THINC Method 568
Chen Hansheng: China’s Last Romantic Revolutionary 500
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3137034
求助须知:如何正确求助?哪些是违规求助? 2788014
关于积分的说明 7784270
捐赠科研通 2444088
什么是DOI,文献DOI怎么找? 1299724
科研通“疑难数据库(出版商)”最低求助积分说明 625522
版权声明 600999