邻接矩阵
计算机科学
非负矩阵分解
疾病
矩阵分解
图形
语义相似性
核(代数)
人工智能
模式识别(心理学)
计算生物学
理论计算机科学
数学
生物
特征向量
医学
组合数学
物理
病理
量子力学
作者
Mei-Neng Wang,Zhu‐Hong You,Lei Wang,Liping Li,Kai Zheng
标识
DOI:10.1016/j.neucom.2020.02.062
摘要
Emerging evidence suggests that long non-coding RNAs (lncRNAs) play an important role in various biological processes and human diseases. Exploring the associations between lncRNAs and diseases can better understand the complex disease mechanisms. However, expensive and time-consuming for exploring by biological experiments, it is imperative to develop more accurate and efficient computational approaches to predicting lncRNA-disease associations. In this work, we develop a new computational approach to predict lncRNA-disease associations using graph regularized nonnegative matrix factorization (LDGRNMF), which considers disease-associated lncRNAs identification as recommendation system problem. More specifically, we calculate the similarity of disease based on Gaussian interaction profile kernel and disease semantic information, and calculate the similarity of lncRNA based on Gaussian interaction profile kernel. Secondly, the weighted K nearest known neighbor interaction profiles is applied to reconstruct lncRNA-disease association adjacency matrix. Finally, graph regularized nonnegative matrix factorization is exploited to predict the potential associations between lncRNAs and diseases. In the five-fold cross-validation experiments, LDGRNMF achieves AUC of 0.8985 which outperforms other compared methods. Moreover, in case studies for stomach cancer, breast cancer and lung cancer, 9, 8 and 6 of the top 10 candidate lncRNAs predicted by LDGRNMF are verified, respectively. Rigorous experimental results indicate that our method can be regarded as an effectively tool for predicting potential lncRNA-disease associations.
科研通智能强力驱动
Strongly Powered by AbleSci AI