TY - JOUR
T1 - LDGRNMF
T2 - LncRNA-disease associations prediction based on graph regularized non-negative matrix factorization
AU - Wang, Mei Neng
AU - You, Zhu Hong
AU - Wang, Lei
AU - Li, Li Ping
AU - Zheng, Kai
N1 - Publisher Copyright:
© 2020 Elsevier B.V.
PY - 2021/2/1
Y1 - 2021/2/1
N2 - 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.
AB - 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.
KW - Graph regularization
KW - LncRNA-disease associations
KW - LncRNA-disease similarity
KW - Nonnegative matrix factorization
UR - http://www.scopus.com/inward/record.url?scp=85081350154&partnerID=8YFLogxK
U2 - 10.1016/j.neucom.2020.02.062
DO - 10.1016/j.neucom.2020.02.062
M3 - 文章
AN - SCOPUS:85081350154
SN - 0925-2312
VL - 424
SP - 236
EP - 245
JO - Neurocomputing
JF - Neurocomputing
ER -