最大值和最小值
计算机科学
联营
卷积(计算机科学)
嵌入
水准点(测量)
化学信息学
还原(数学)
虚拟筛选
图形
人工智能
数据挖掘
模式识别(心理学)
药物发现
算法
数学
人工神经网络
理论计算机科学
生物信息学
数学分析
生物
几何学
大地测量学
地理
作者
Tanoj Langore,Te-Cheng Hsu,Yi-Hsien Hsieh,Che Lin
标识
DOI:10.1109/icassp49357.2023.10096347
摘要
One of the essential parts of drug discovery and design is the prediction of drug-target affinity (DTA). Researchers have proposed computational approaches for predicting DTA to circumvent the more expensive in vivo and in vitro tests. More recent approaches employed deep network architectures to obtain the features from the drug molecules and protein sequences. The drug compounds are represented as graphs and the target protein as a sequence to extract this information. In this work, we develop a new graph-based prediction model, termed LE-DTA, that utilizes local extrema convolutions for effective feature extraction. It focuses on the local and global extrema of graphs for node embedding. We investigated the performances of both the proposed models on three different benchmark datasets. Our proposed model showed improvement in CI by 1.12% and 0.35% and a reduction in MSE by 7.7% and 3.33% on the KIBA and BindingDB datasets, respectively. we also showed that despite using various pooling operations on our proposed model, we achieved an average reduction in MSE by 7% on the KIBA dataset and 3% improvement on the BindingDB dataset.
科研通智能强力驱动
Strongly Powered by AbleSci AI