TeX-Graph: Coupled tensor-matrix knowledge-graph embedding for COVID-19 drug repurposing

• URL: http://arxiv.org/abs/2010.11367v2
• Date: Sun, 25 Oct 2020 23:44:06 GMT
• Title: TeX-Graph: Coupled tensor-matrix knowledge-graph embedding for COVID-19 drug repurposing
• Authors: Charilaos I. Kanatsoulis, and Nicholas D. Sidiropoulos
• Abstract summary: We propose a novel coupled tensor-matrix framework for KG embedding. We leverage tensor factorization tools to learn concise representations of entities and relations in knowledge bases. Our proposed framework is principled, elegant, and achieves 100% improvement over the best baseline in the COVID-19 drug repurposing task.
• Score: 34.25102483600248
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Knowledge graphs (KGs) are powerful tools that codify relational behaviour between entities in knowledge bases. KGs can simultaneously model many different types of subject-predicate-object and higher-order relations. As such, they offer a flexible modeling framework that has been applied to many areas, including biology and pharmacology -- most recently, in the fight against COVID-19. The flexibility of KG modeling is both a blessing and a challenge from the learning point of view. In this paper we propose a novel coupled tensor-matrix framework for KG embedding. We leverage tensor factorization tools to learn concise representations of entities and relations in knowledge bases and employ these representations to perform drug repurposing for COVID-19. Our proposed framework is principled, elegant, and achieves 100% improvement over the best baseline in the COVID-19 drug repurposing task using a recently developed biological KG.

Related papers

• Distill-SynthKG: Distilling Knowledge Graph Synthesis Workflow for Improved Coverage and Efficiency [59.6772484292295]
  Knowledge graphs (KGs) generated by large language models (LLMs) are increasingly valuable for Retrieval-Augmented Generation (RAG) applications. Existing KG extraction methods rely on prompt-based approaches, which are inefficient for processing large-scale corpora. We propose SynthKG, a multi-step, document-level synthesis KG workflow based on LLMs. We also design a novel graph-based retrieval framework for RAG.
  arXiv  Detail & Related papers  (2024-10-22T00:47:54Z)
• Knowledge Graph Embedding: An Overview [42.16033541753744]
  We make a comprehensive overview of the current state of research in Knowledge Graph completion. We focus on two main branches of KG embedding (KGE) design: 1) distance-based methods and 2) semantic matching-based methods. Next, we delve into CompoundE and CompoundE3D, which draw inspiration from 2D and 3D affine operations.
  arXiv  Detail & Related papers  (2023-09-21T21:52:42Z)
• Dynamic Graph Enhanced Contrastive Learning for Chest X-ray Report Generation [92.73584302508907]
  We propose a knowledge graph with Dynamic structure and nodes to facilitate medical report generation with Contrastive Learning. In detail, the fundamental structure of our graph is pre-constructed from general knowledge. Each image feature is integrated with its very own updated graph before being fed into the decoder module for report generation.
  arXiv  Detail & Related papers  (2023-03-18T03:53:43Z)
• I Know What You Do Not Know: Knowledge Graph Embedding via Co-distillation Learning [16.723470319188102]
  Knowledge graph embedding seeks to learn vector representations for entities and relations. Recent studies have used pre-trained language models to learn embeddings based on the textual information of entities and relations. We propose CoLE, a Co-distillation Learning method for KG Embedding that exploits the complement of graph structures and text information.
  arXiv  Detail & Related papers  (2022-08-21T07:34:37Z)
• What is Learned in Knowledge Graph Embeddings? [3.224929252256631]
  A knowledge graph (KG) is a data structure which represents entities and relations as the vertices and edges of a directed graph with edge types. We investigate whether learning rules between relations is indeed what drives the performance of embedding-based methods. Using experiments on synthetic KGs, we show that KG models can learn motifs and how this ability is degraded by non-motif edges.
  arXiv  Detail & Related papers  (2021-10-19T13:52:11Z)
• Scientific Language Models for Biomedical Knowledge Base Completion: An Empirical Study [62.376800537374024]
  We study scientific LMs for KG completion, exploring whether we can tap into their latent knowledge to enhance biomedical link prediction. We integrate the LM-based models with KG embedding models, using a router method that learns to assign each input example to either type of model and provides a substantial boost in performance.
  arXiv  Detail & Related papers  (2021-06-17T17:55:33Z)
• Knowledge Association with Hyperbolic Knowledge Graph Embeddings [32.540462980828536]
  We propose a hyperbolic relational graph neural network for KG embedding and capture knowledge associations with a hyperbolic transformation. Experiments on entity alignment and type inference demonstrate the effectiveness and efficiency of our method.
  arXiv  Detail & Related papers  (2020-10-05T17:11:35Z)
• Knowledge Graph Embeddings in Geometric Algebras [14.269860621624392]
  We introduce a novel geometric algebra-based KG embedding framework, GeomE. Our framework subsumes several state-of-the-art KG embedding approaches and is advantageous with its ability of modeling various key relation patterns. Experimental results on multiple benchmark knowledge graphs show that theproposed approach outperforms existing state-of-the-art models for link prediction.
  arXiv  Detail & Related papers  (2020-10-02T13:36:24Z)
• Tensor Graph Convolutional Networks for Multi-relational and Robust Learning [74.05478502080658]
  This paper introduces a tensor-graph convolutional network (TGCN) for scalable semi-supervised learning (SSL) from data associated with a collection of graphs, that are represented by a tensor. The proposed architecture achieves markedly improved performance relative to standard GCNs, copes with state-of-the-art adversarial attacks, and leads to remarkable SSL performance over protein-to-protein interaction networks.
  arXiv  Detail & Related papers  (2020-03-15T02:33:21Z)
• Generative Adversarial Zero-Shot Relational Learning for Knowledge Graphs [96.73259297063619]
  We consider a novel formulation, zero-shot learning, to free this cumbersome curation. For newly-added relations, we attempt to learn their semantic features from their text descriptions. We leverage Generative Adrial Networks (GANs) to establish the connection between text and knowledge graph domain.
  arXiv  Detail & Related papers  (2020-01-08T01:19:08Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.