矩阵分解
正规化(语言学)
计算机科学
图形
数据挖掘
秩(图论)
人工智能
算法
数学
理论计算机科学
特征向量
物理
量子力学
组合数学
作者
Chengwei Ai,Hongpeng Yang,Yijie Ding,Jijun Tang,Fei Guo
标识
DOI:10.1109/tcbb.2023.3274587
摘要
Detecting potential associations between drugs and diseases plays an indispensable role in drug development, which has also become a research hotspot in recent years. Compared with traditional methods, some computational approaches have the advantages of fast speed and low cost, which greatly accelerate the progress of predicting the drug-disease association. In this study, we propose a novel similarity-based method of low-rank matrix decomposition based on multi-graph regularization. On the basis of low-rank matrix factorization with L2 regularization, the multi-graph regularization constraint is constructed by combining a variety of similarity matrices from drugs and diseases respectively. In the experiments, we analyze the difference in the combination of different similarities, resulting that combining all the similarity information on drug space is unnecessary, and only a part of the similarity information can achieve the desired performance. Then our method is compared with other existing models on three data sets (Fdataset, Cdataset and LRSSLdataset) and have a good advantage in the evaluation measurement of AUPR. Besides, a case study experiment is conducted and showing that the superior ability for predicting the potential disease-related drugs of our model. Finally, we compare our model with some methods on six real world datasets, and our model has a good performance in detecting real world data.
科研通智能强力驱动
Strongly Powered by AbleSci AI