A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach

• URL: http://arxiv.org/abs/2211.10018v1
• Date: Fri, 18 Nov 2022 03:51:28 GMT
• Title: A Dataset for Hyper-Relational Extraction and a Cube-Filling Approach
• Authors: Yew Ken Chia, Lidong Bing, Sharifah Mahani Aljunied, Luo Si and Soujanya Poria
• Abstract summary: We propose the task of hyper-relational extraction to extract more specific and complete facts from text. Existing models cannot perform hyper-relational extraction as it requires a model to consider the interaction between three entities. We propose CubeRE, a cube-filling model inspired by table-filling approaches and explicitly considers the interaction between relation triplets and qualifiers.
• Score: 59.89749342550104
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Relation extraction has the potential for large-scale knowledge graph construction, but current methods do not consider the qualifier attributes for each relation triplet, such as time, quantity or location. The qualifiers form hyper-relational facts which better capture the rich and complex knowledge graph structure. For example, the relation triplet (Leonard Parker, Educated At, Harvard University) can be factually enriched by including the qualifier (End Time, 1967). Hence, we propose the task of hyper-relational extraction to extract more specific and complete facts from text. To support the task, we construct HyperRED, a large-scale and general-purpose dataset. Existing models cannot perform hyper-relational extraction as it requires a model to consider the interaction between three entities. Hence, we propose CubeRE, a cube-filling model inspired by table-filling approaches and explicitly considers the interaction between relation triplets and qualifiers. To improve model scalability and reduce negative class imbalance, we further propose a cube-pruning method. Our experiments show that CubeRE outperforms strong baselines and reveal possible directions for future research. Our code and data are available at github.com/declare-lab/HyperRED.

Related papers

• Prompt Based Tri-Channel Graph Convolution Neural Network for Aspect Sentiment Triplet Extraction [63.0205418944714]
  Aspect Sentiment Triplet Extraction (ASTE) is an emerging task to extract a given sentence's triplets, which consist of aspects, opinions, and sentiments. Recent studies tend to address this task with a table-filling paradigm, wherein word relations are encoded in a two-dimensional table. We propose a novel model for the ASTE task, called Prompt-based Tri-Channel Graph Convolution Neural Network (PT-GCN), which converts the relation table into a graph to explore more comprehensive relational information.
  arXiv  Detail & Related papers  (2023-12-18T12:46:09Z)
• Combinatorial Complexes: Bridging the Gap Between Cell Complexes and Hypergraphs [18.793940779717627]
  We argue that hypergraphs and cell complexes emphasize emphdifferent types of relations, which may have different utility depending on the application context. We discuss the relative advantages of these two choices and elaborate on the previously introduced concept of a complex that enables co-existing set-type and hierarchical relations.
  arXiv  Detail & Related papers  (2023-12-15T03:04:28Z)
• Joint Entity and Relation Extraction with Span Pruning and Hypergraph Neural Networks [58.43972540643903]
  We propose HyperGraph neural network for ERE ($hgnn$), which is built upon the PL-marker (a state-of-the-art marker-based pipleline model) To alleviate error propagation,we use a high-recall pruner mechanism to transfer the burden of entity identification and labeling from the NER module to the joint module of our model. Experiments on three widely used benchmarks for ERE task show significant improvements over the previous state-of-the-art PL-marker.
  arXiv  Detail & Related papers  (2023-10-26T08:36:39Z)
• HyperFormer: Enhancing Entity and Relation Interaction for Hyper-Relational Knowledge Graph Completion [25.399684403558553]
  Hyper-relational knowledge graphs (HKGs) extend standard knowledge graphs by associating attribute-value qualifiers to triples. We propose HyperFormer, a model that considers local-level sequential information, which encodes the content of the entities, relations and qualifiers of a triple.
  arXiv  Detail & Related papers  (2023-08-12T09:31:43Z)
• Shrinking Embeddings for Hyper-Relational Knowledge Graphs [42.23862602535092]
  We present emphShrinkE, a geometric hyper-relational KG embedding method aiming to explicitly model these patterns. Experimental results demonstrate ShrinkE's superiority on three benchmarks of hyper-relational KGs.
  arXiv  Detail & Related papers  (2023-06-03T21:14:59Z)
• Few-shot Link Prediction on N-ary Facts [70.8150181683017]
  Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact. Few-Shot Link Prediction on Hyper-relational Facts (PHFs) aims to predict a missing entity in a hyper-relational fact with limited support instances.
  arXiv  Detail & Related papers  (2023-05-10T12:44:00Z)
• HIORE: Leveraging High-order Interactions for Unified Entity Relation Extraction [85.80317530027212]
  We propose HIORE, a new method for unified entity relation extraction. The key insight is to leverage the complex association among word pairs, which contains richer information than the first-order word-by-word interactions. Experiments show that HIORE achieves the state-of-the-art performance on relation extraction and an improvement of 1.11.8 F1 points over the prior best unified model.
  arXiv  Detail & Related papers  (2023-05-07T14:57:42Z)
• Learning Representations for Hyper-Relational Knowledge Graphs [35.380689788802776]
  We design a framework to learn representations for hyper-relational facts using multiple aggregators. Experiments demonstrate the effectiveness of our framework across multiple datasets. We conduct an ablation study that validates the importance of the various components in our framework.
  arXiv  Detail & Related papers  (2022-08-30T15:02:14Z)
• RelationPrompt: Leveraging Prompts to Generate Synthetic Data for Zero-Shot Relation Triplet Extraction [65.4337085607711]
  We introduce the task setting of Zero-Shot Relation Triplet Extraction (ZeroRTE) Given an input sentence, each extracted triplet consists of the head entity, relation label, and tail entity where the relation label is not seen at the training stage. We propose to synthesize relation examples by prompting language models to generate structured texts.
  arXiv  Detail & Related papers  (2022-03-17T05:55:14Z)

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.