GCFMCL: predicting miRNA-drug sensitivity using graph collaborative filtering and multi-view contrastive learning

计算机科学 图形 人工智能 特征(语言学) 机器学习 特征学习 节点(物理) 药物靶点 理论计算机科学 语言学 哲学 结构工程 工程类 医学 药理学
作者
Jinhang Wei,Linlin Zhuo,Ziqing Zhou,Xinze Lian,Xiquan Fu,Xiaojun Yao
出处
期刊:Briefings in Bioinformatics [Oxford University Press]
卷期号:24 (4) 被引量:6
标识
DOI:10.1093/bib/bbad247
摘要

Studies have shown that the mechanism of action of many drugs is related to miRNA. In-depth research on the relationship between miRNA and drugs can provide theoretical foundations and practical approaches for various areas, such as drug target discovery, drug repositioning and biomarker research. Traditional biological experiments to test miRNA-drug susceptibility are costly and time-consuming. Thus, sequence- or topology-based deep learning methods are recognized in this field for their efficiency and accuracy. However, these methods have limitations in dealing with sparse topologies and higher-order information of miRNA (drug) feature. In this work, we propose GCFMCL, a model for multi-view contrastive learning based on graph collaborative filtering. To the best of our knowledge, this is the first attempt that incorporates contrastive learning strategy into the graph collaborative filtering framework to predict the sensitivity relationships between miRNA and drug. The proposed multi-view contrastive learning method is divided into topological contrastive objective and feature contrastive objective: (1) For the homogeneous neighbors of the topological graph, we propose a novel topological contrastive learning method via constructing the contrastive target through the topological neighborhood information of nodes. (2) The proposed model obtains feature contrastive targets from high-order feature information according to the correlation of node features, and mines potential neighborhood relationships in the feature space. The proposed multi-view comparative learning effectively alleviates the impact of heterogeneous node noise and graph data sparsity in graph collaborative filtering, and significantly enhances the performance of the model. Our study employs a dataset derived from the NoncoRNA and ncDR databases, encompassing 2049 experimentally validated miRNA-drug sensitivity associations. Five-fold cross-validation shows that the Area Under the Curve (AUC), Area Under the Precision-Recall Curve (AUPR) and F1-score (F1) of GCFMCL reach 95.28%, 95.66% and 89.77%, which outperforms the state-of-the-art (SOTA) method by the margin of 2.73%, 3.42% and 4.96%, respectively. Our code and data can be accessed at https://github.com/kkkayle/GCFMCL.
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
3秒前
6秒前
Aaaaaajjjj发布了新的文献求助10
9秒前
还好完成签到,获得积分10
13秒前
yznfly给gyq的求助进行了留言
13秒前
学术laji完成签到 ,获得积分10
14秒前
唐唐完成签到 ,获得积分10
14秒前
cjj完成签到,获得积分10
17秒前
banana完成签到 ,获得积分10
17秒前
18秒前
崽崽完成签到,获得积分20
19秒前
岁月荣耀完成签到 ,获得积分10
22秒前
28秒前
allorate完成签到,获得积分10
29秒前
科研通AI2S应助edsenone采纳,获得10
31秒前
完美世界应助YaHe采纳,获得10
32秒前
CipherSage应助STNZEN采纳,获得10
32秒前
tikka完成签到,获得积分10
33秒前
Allen完成签到,获得积分10
34秒前
37秒前
39秒前
40秒前
姜峰完成签到,获得积分10
45秒前
abu发布了新的文献求助10
46秒前
YaHe发布了新的文献求助10
47秒前
言不得语发布了新的文献求助10
50秒前
kaizt完成签到,获得积分10
51秒前
violin发布了新的文献求助10
52秒前
jiangci完成签到,获得积分10
53秒前
54秒前
55秒前
56秒前
坚强的广山应助violin采纳,获得30
58秒前
852应助迅哥采纳,获得10
58秒前
Hello应助kaizt采纳,获得10
58秒前
1分钟前
1分钟前
1分钟前
1分钟前
研友_8yVV0L完成签到 ,获得积分10
1分钟前
高分求助中
求助这个网站里的问题集 1000
Floxuridine; Third Edition 1000
Models of Teaching(The 10th Edition,第10版!)《教学模式》(第10版!) 800
La décision juridictionnelle 800
Rechtsphilosophie und Rechtstheorie 800
Nonlocal Integral Equation Continuum Models: Nonstandard Symmetric Interaction Neighborhoods and Finite Element Discretizations 600
https://doi.org/10.1016/B978-0-08-102688-5.00007-6 500
热门求助领域 (近24小时)
化学 医学 材料科学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 物理化学 催化作用 免疫学 细胞生物学 电极
热门帖子
关注 科研通微信公众号,转发送积分 2872994
求助须知:如何正确求助?哪些是违规求助? 2481766
关于积分的说明 6722580
捐赠科研通 2167234
什么是DOI,文献DOI怎么找? 1151287
版权声明 585722
科研通“疑难数据库(出版商)”最低求助积分说明 565223