Knowledge Graph Completion based on Tensor Decomposition for Disease Gene Prediction
Accurate identification of disease genes has consistently been one of the keys to decoding a disease's molecular mechanism. Most current approaches focus on constructing biological networks and utilizing machine learning, especially, deep learning to identify disease genes, but ignore the complex relations between entities in the biological knowledge graph. In this paper, we construct a biological knowledge graph centered on diseases and genes, and develop an end-to-end Knowledge graph completion model for Disease Gene Prediction using interactional tensor decomposition (called KDGene). KDGene introduces an interaction module between the embeddings of entities and relations to tensor decomposition, which can effectively enhance the information interaction in biological knowledge. Experimental results show that KDGene significantly outperforms state-of-the-art algorithms. Furthermore, the comprehensive biological analysis of the case of diabetes mellitus confirms KDGene's ability for identifying new and accurate candidate genes. This work proposes a scalable knowledge graph completion framework to identify disease candidate genes, from which the results are promising to provide valuable references for further wet experiments.
Code (1)
Tasks
Knowledge Graph CompletionTensor DecompositionSimilar Papers 제목 키워드 기반
Knowledge Graph Completion as Tensor Decomposition: A Genreal Form and Tensor N-rank Regularization
Knowledge graph completion (KGC) is a 3rd-order binary tensor completion task. Tensor decomposition based (TDB) models have shown great performance in KGC. In this paper, we summarize existing TDB models and derive a gen…
FormKnowledge Graph CompletionTensor DecompositionTucker decomposition-based Temporal Knowledge Graph Completion
Knowledge graphs have been demonstrated to be an effective tool for numerous intelligent applications. However, a large amount of valuable knowledge still exists implicitly in the knowledge graphs. To enrich the existing…
Knowledge Graph CompletionKnowledge GraphsLink PredictionTemporal Knowledge Graph Completion+1Global and Local Structure Learning for Sparse Tensor Completion
How can we accurately complete tensors by learning relationships of dimensions along each mode? Tensor completion, a widely studied problem, is to predict missing entries in incomplete tensors. Tensor decomposition metho…
Tensor DecompositionKnowledge Graph Completion with Mixed Geometry Tensor Factorization
In this paper, we propose a new geometric approach for knowledge graph completion via low rank tensor approximation. We augment a pretrained and well-established Euclidean model based on a Tucker tensor decomposition wit…
Knowledge Graph CompletionKnowledge GraphsLink PredictionTensor Decomposition+1Canonical Tensor Decomposition for Knowledge Base Completion
The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, cur…
Dynamic Link PredictionKnowledge Base CompletionLink PredictionTensor Decomposition