GraphPrompt: Graph-Based Prompt Templates for Biomedical Synonym Prediction

• URL: http://arxiv.org/abs/2112.03002v2
• Date: Tue, 28 Nov 2023 14:37:45 GMT
• Title: GraphPrompt: Graph-Based Prompt Templates for Biomedical Synonym Prediction
• Authors: Hanwen Xu, Jiayou Zhang, Zhirui Wang, Shizhuo Zhang, Megh Manoj Bhalerao, Yucong Liu, Dawei Zhu, Sheng Wang
• Abstract summary: We introduce an expert-curated dataset OBO-syn encompassing 70 different types of concepts and 2 million curated concept-term pairs for evaluating synonym prediction methods. We propose GraphPrompt, a prompt-based learning approach that creates prompt templates according to the graphs. We envision that our method GraphPrompt and OBO-syn dataset can be applied broadly to graph-based NLP tasks, and serve as the basis for analyzing diverse and accumulating biomedical data.
• Score: 12.604871572399722
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In the expansion of biomedical dataset, the same category may be labeled with different terms, thus being tedious and onerous to curate these terms. Therefore, automatically mapping synonymous terms onto the ontologies is desirable, which we name as biomedical synonym prediction task. Unlike biomedical concept normalization (BCN), no clues from context can be used to enhance synonym prediction, making it essential to extract graph features from ontology. We introduce an expert-curated dataset OBO-syn encompassing 70 different types of concepts and 2 million curated concept-term pairs for evaluating synonym prediction methods. We find BCN methods perform weakly on this task for not making full use of graph information. Therefore, we propose GraphPrompt, a prompt-based learning approach that creates prompt templates according to the graphs. GraphPrompt obtained 37.2\% and 28.5\% improvement on zero-shot and few-shot settings respectively, indicating the effectiveness of these graph-based prompt templates. We envision that our method GraphPrompt and OBO-syn dataset can be broadly applied to graph-based NLP tasks, and serve as the basis for analyzing diverse and accumulating biomedical data. All the data and codes are avalible at: https://github.com/HanwenXuTHU/GraphPrompt

Related papers

• Neural Graph Pattern Machine [50.78679002846741]
  We propose the Neural Graph Pattern Machine (GPM), a framework designed to learn directly from graph patterns. GPM efficiently extracts and encodes substructures while identifying the most relevant ones for downstream tasks.
  arXiv  Detail & Related papers  (2025-01-30T20:37:47Z)
• Graph Neural Networks on Discriminative Graphs of Words [19.817473565906777]
  In this work, we explore a new Discriminative Graph of Words Graph Neural Network (DGoW-GNN) approach to classify text. We propose a new model for the graph-based classification of text, which combines a GNN and a sequence model. We evaluate our approach on seven benchmark datasets and find that it is outperformed by several state-of-the-art baseline models.
  arXiv  Detail & Related papers  (2024-10-27T15:14:06Z)
• G-Retriever: Retrieval-Augmented Generation for Textual Graph Understanding and Question Answering [61.93058781222079]
  We develop a flexible question-answering framework targeting real-world textual graphs. We introduce the first retrieval-augmented generation (RAG) approach for general textual graphs. G-Retriever performs RAG over a graph by formulating this task as a Prize-Collecting Steiner Tree optimization problem.
  arXiv  Detail & Related papers  (2024-02-12T13:13:04Z)
• Self-supervised Learning for Heterogeneous Graph via Structure Information based on Metapath [9.757299837675204]
  Self-supervised representation learning is a potential approach to tackle this problem. In this paper, we propose a SElfsupervised learning method for heterogeneous graph via Structure Information based on Metapath. In order to predict jump number, SESIM uses data itself to generate labels, avoiding time-consuming manual labeling.
  arXiv  Detail & Related papers  (2022-09-09T10:06:18Z)
• Semi-Supervised Hierarchical Graph Classification [54.25165160435073]
  We study the node classification problem in the hierarchical graph where a 'node' is a graph instance. We propose the Hierarchical Graph Mutual Information (HGMI) and present a way to compute HGMI with theoretical guarantee. We demonstrate the effectiveness of this hierarchical graph modeling and the proposed SEAL-CI method on text and social network data.
  arXiv  Detail & Related papers  (2022-06-11T04:05:29Z)
• Graph-in-Graph Network for Automatic Gene Ontology Description Generation [55.40404942182707]
  We propose a novel task: GO term description generation. This task aims to automatically generate a sentence that describes the function of a GO term belonging to one of three categories. The proposed network introduces a two-layer graph: the first layer is a graph of GO terms where each node is also a graph (gene graph)
  arXiv  Detail & Related papers  (2022-06-10T18:17:17Z)
• Graph-in-Graph (GiG): Learning interpretable latent graphs in non-Euclidean domain for biological and healthcare applications [52.65389473899139]
  Graphs are a powerful tool for representing and analyzing unstructured, non-Euclidean data ubiquitous in the healthcare domain. Recent works have shown that considering relationships between input data samples have a positive regularizing effect for the downstream task. We propose Graph-in-Graph (GiG), a neural network architecture for protein classification and brain imaging applications.
  arXiv  Detail & Related papers  (2022-04-01T10:01:37Z)
• Neural Graph Matching for Pre-training Graph Neural Networks [72.32801428070749]
  Graph neural networks (GNNs) have been shown powerful capacity at modeling structural data. We present a novel Graph Matching based GNN Pre-Training framework, called GMPT. The proposed method can be applied to fully self-supervised pre-training and coarse-grained supervised pre-training.
  arXiv  Detail & Related papers  (2022-03-03T09:53:53Z)
• Model-Agnostic Augmentation for Accurate Graph Classification [19.824105919844495]
  Graph augmentation is an essential strategy to improve the performance of graph-based tasks. In this work, we introduce five desired properties for effective augmentation. Our experiments on social networks and molecular graphs show that NodeSam and SubMix outperform existing approaches in graph classification.
  arXiv  Detail & Related papers  (2022-02-21T10:37:53Z)
• Graphine: A Dataset for Graph-aware Terminology Definition Generation [17.978450464176863]
  We present a large-scale terminology definition dataset Graphine covering 2,010,648 terminology definition pairs. We propose a novel graph-aware definition generation model Graphex that integrates transformer with graph neural network.
  arXiv  Detail & Related papers  (2021-09-09T03:29:23Z)
• Inverse Graph Identification: Can We Identify Node Labels Given Graph Labels? [89.13567439679709]
  Graph Identification (GI) has long been researched in graph learning and is essential in certain applications. This paper defines a novel problem dubbed Inverse Graph Identification (IGI) We propose a simple yet effective method that makes the node-level message passing process using Graph Attention Network (GAT) under the protocol of GI.
  arXiv  Detail & Related papers  (2020-07-12T12:06:17Z)

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.