Open Relation and Event Type Discovery with Type Abstraction

• URL: http://arxiv.org/abs/2212.00178v1
• Date: Wed, 30 Nov 2022 23:47:49 GMT
• Title: Open Relation and Event Type Discovery with Type Abstraction
• Authors: Sha Li, Heng Ji, Jiawei Han
• Abstract summary: We introduce the idea of type abstraction, where the model is prompted to generalize and name the type. We use the similarity between inferred names to induce clusters. Our experiments on multiple relation extraction and extraction event datasets consistently show the advantage of our type abstraction approach.
• Score: 80.92395639632383
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Conventional closed-world information extraction (IE) approaches rely on human ontologies to define the scope for extraction. As a result, such approaches fall short when applied to new domains. This calls for systems that can automatically infer new types from given corpora, a task which we refer to as type discovery. To tackle this problem, we introduce the idea of type abstraction, where the model is prompted to generalize and name the type. Then we use the similarity between inferred names to induce clusters. Observing that this abstraction-based representation is often complementary to the entity/trigger token representation, we set up these two representations as two views and design our model as a co-training framework. Our experiments on multiple relation extraction and event extraction datasets consistently show the advantage of our type abstraction approach. Code available at https://github.com/raspberryice/type-discovery-abs.

Related papers

• Ref-Diff: Zero-shot Referring Image Segmentation with Generative Models [68.73086826874733]
  We introduce a novel Referring Diffusional segmentor (Ref-Diff) for referring image segmentation. We demonstrate that without a proposal generator, a generative model alone can achieve comparable performance to existing SOTA weakly-supervised models. This indicates that generative models are also beneficial for this task and can complement discriminative models for better referring segmentation.
  arXiv  Detail & Related papers  (2023-08-31T14:55:30Z)
• Modeling Entities as Semantic Points for Visual Information Extraction in the Wild [55.91783742370978]
  We propose an alternative approach to precisely and robustly extract key information from document images. We explicitly model entities as semantic points, i.e., center points of entities are enriched with semantic information describing the attributes and relationships of different entities. The proposed method can achieve significantly enhanced performance on entity labeling and linking, compared with previous state-of-the-art models.
  arXiv  Detail & Related papers  (2023-03-23T08:21:16Z)
• Semi-supervised New Event Type Induction and Description via Contrastive Loss-Enforced Batch Attention [56.46649994444616]
  We present a novel approach to semi-supervised new event type induction using a masked contrastive loss. We extend our approach to two new tasks: predicting the type name of the discovered clusters and linking them to FrameNet frames.
  arXiv  Detail & Related papers  (2022-02-12T00:32:22Z)
• Query and Extract: Refining Event Extraction as Type-oriented Binary Decoding [51.57864297948228]
  We propose a novel event extraction framework that takes event types and argument roles as natural language queries. Our framework benefits from the attention mechanisms to better capture the semantic correlation between the event types or argument roles and the input text.
  arXiv  Detail & Related papers  (2021-10-14T15:49:40Z)
• Element Intervention for Open Relation Extraction [27.408443348900057]
  OpenRE aims to cluster relation instances referring to the same underlying relation. Current OpenRE models are commonly trained on the datasets generated from distant supervision. In this paper, we revisit the procedure of OpenRE from a causal view.
  arXiv  Detail & Related papers  (2021-06-17T14:37:13Z)
• Joint Entity and Relation Canonicalization in Open Knowledge Graphs using Variational Autoencoders [11.259587284318835]
  Noun phrases and relation phrases in open knowledge graphs are not canonicalized, leading to an explosion of redundant and ambiguous subject-relation-object triples. Existing approaches to face this problem take a two-step approach: first, they generate embedding representations for both noun and relation phrases, then a clustering algorithm is used to group them using the embeddings as features. In this work, we propose Canonicalizing Using Variational AutoEncoders (CUVA), a joint model to learn both embeddings and cluster assignments in an end-to-end approach.
  arXiv  Detail & Related papers  (2020-12-08T22:58:30Z)
• Clustering-based Unsupervised Generative Relation Extraction [3.342376225738321]
  We propose a Clustering-based Unsupervised generative Relation Extraction framework (CURE) We use an "Encoder-Decoder" architecture to perform self-supervised learning so the encoder can extract relation information. Our model performs better than state-of-the-art models on both New York Times (NYT) and United Nations Parallel Corpus (UNPC) standard datasets.
  arXiv  Detail & Related papers  (2020-09-26T20:36:40Z)
• Commonality-Parsing Network across Shape and Appearance for Partially Supervised Instance Segmentation [71.59275788106622]
  We propose to learn the underlying class-agnostic commonalities that can be generalized from mask-annotated categories to novel categories. Our model significantly outperforms the state-of-the-art methods on both partially supervised setting and few-shot setting for instance segmentation on COCO dataset.
  arXiv  Detail & Related papers  (2020-07-24T07:23:44Z)

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.