期刊
BRIEFINGS IN BIOINFORMATICS
卷 23, 期 1, 页码 -出版社
OXFORD UNIV PRESS
DOI: 10.1093/bib/bbab361
关键词
deep learning; matrix completion; conditional random field; lncRNA-disease associations
资金
- National Natural Science Foundation of China [62162015, 61762026, 61462018, 61903248]
- Guangxi Natural Science Foundation [2017GXNSFAA198278]
- Innovation Project of GUET Graduate Education [2019YCXS056]
- GUET Excellent Graduate Thesis Program [18YJPYSS14]
This study proposed a novel prediction method based on graph convolutional matrix completion to efficiently predict lncRNA-disease associations, which outperformed existing methods on benchmark datasets and disease case studies.
Long noncoding RNAs (lncRNAs) play important roles in various biological regulatory processes, and are closely related to the occurrence and development of diseases. Identifying lncRNA-disease associations is valuable for revealing the molecular mechanism of diseases and exploring treatment strategies. Thus, it is necessary to computationally predict lncRNA-disease associations as a complementary method for biological experiments. In this study, we proposed a novel prediction method GCRFLDA based on the graph convolutional matrix completion. GCRFLDA first constructed a graph using the available lncRNA-disease association information. Then, it constructed an encoder consisting of conditional random field and attention mechanism to learn efficient embeddings of nodes, and a decoder layer to score lncRNA-disease associations. In GCRFLDA, the Gaussian interaction profile kernels similarity and cosine similarity were fused as side information of lncRNA and disease nodes. Experimental results on four benchmark datasets show that GCRFLDA is superior to other existing methods. Moreover, we conducted case studies on four diseases and observed that 70 of 80 predicted associated lncRNAs were confirmed by the literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据