Logic-guided Semantic Representation Learning for Zero-Shot Relation
Classification
- URL: http://arxiv.org/abs/2010.16068v1
- Date: Fri, 30 Oct 2020 04:30:09 GMT
- Title: Logic-guided Semantic Representation Learning for Zero-Shot Relation
Classification
- Authors: Juan Li, Ruoxu Wang, Ningyu Zhang, Wen Zhang, Fan Yang, Huajun Chen
- Abstract summary: We propose a novel logic-guided semantic representation learning model for zero-shot relation classification.
Our approach builds connections between seen and unseen relations via implicit and explicit semantic representations with knowledge graph embeddings and logic rules.
- Score: 31.887770824130957
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Relation classification aims to extract semantic relations between entity
pairs from the sentences. However, most existing methods can only identify seen
relation classes that occurred during training. To recognize unseen relations
at test time, we explore the problem of zero-shot relation classification.
Previous work regards the problem as reading comprehension or textual
entailment, which have to rely on artificial descriptive information to improve
the understandability of relation types. Thus, rich semantic knowledge of the
relation labels is ignored. In this paper, we propose a novel logic-guided
semantic representation learning model for zero-shot relation classification.
Our approach builds connections between seen and unseen relations via implicit
and explicit semantic representations with knowledge graph embeddings and logic
rules. Extensive experimental results demonstrate that our method can
generalize to unseen relation types and achieve promising improvements.
Related papers
- Entity or Relation Embeddings? An Analysis of Encoding Strategies for Relation Extraction [19.019881161010474]
Relation extraction is essentially a text classification problem, which can be tackled by fine-tuning a pre-trained language model (LM)
Existing approaches therefore solve the problem in an indirect way: they fine-tune an LM to learn embeddings of the head and tail entities, and then predict the relationship from these entity embeddings.
Our hypothesis in this paper is that relation extraction models can be improved by capturing relationships in a more direct way.
arXiv Detail & Related papers (2023-12-18T09:58:19Z) - Learning Complete Topology-Aware Correlations Between Relations for Inductive Link Prediction [121.65152276851619]
We show that semantic correlations between relations are inherently edge-level and entity-independent.
We propose a novel subgraph-based method, namely TACO, to model Topology-Aware COrrelations between relations.
To further exploit the potential of RCN, we propose Complete Common Neighbor induced subgraph.
arXiv Detail & Related papers (2023-09-20T08:11:58Z) - Relational Sentence Embedding for Flexible Semantic Matching [86.21393054423355]
We present Sentence Embedding (RSE), a new paradigm to discover further the potential of sentence embeddings.
RSE is effective and flexible in modeling sentence relations and outperforms a series of state-of-the-art embedding methods.
arXiv Detail & Related papers (2022-12-17T05:25:17Z) - Discovering Fine-Grained Semantics in Knowledge Graph Relations [5.619233302594469]
Polysemous relations between different types of entities represent multiple semantics.
For numerous use cases, such as entity type classification, question answering and knowledge graph completion, the correct semantic interpretation is necessary.
We propose a strategy for discovering the different semantics associated with abstract relations and deriving many sub-relations with fine-grained meaning.
arXiv Detail & Related papers (2022-02-17T22:05:41Z) - Let's be explicit about that: Distant supervision for implicit discourse
relation classification via connective prediction [0.0]
In implicit discourse relation classification, we want to predict the relation between adjacent sentences in the absence of any overt discourse connectives.
We sidestep the lack of data through explicitation of implicit relations to reduce the task to two sub-problems: language modeling and explicit discourse relation classification.
Our experimental results show that this method can even marginally outperform the state-of-the-art, in spite of being much simpler than alternative models of comparable performance.
arXiv Detail & Related papers (2021-06-06T17:57:32Z) - Learning Relation Prototype from Unlabeled Texts for Long-tail Relation
Extraction [84.64435075778988]
We propose a general approach to learn relation prototypes from unlabeled texts.
We learn relation prototypes as an implicit factor between entities.
We conduct experiments on two publicly available datasets: New York Times and Google Distant Supervision.
arXiv Detail & Related papers (2020-11-27T06:21:12Z) - Learning to Decouple Relations: Few-Shot Relation Classification with
Entity-Guided Attention and Confusion-Aware Training [49.9995628166064]
We propose CTEG, a model equipped with two mechanisms to learn to decouple easily-confused relations.
On the one hand, an EGA mechanism is introduced to guide the attention to filter out information causing confusion.
On the other hand, a Confusion-Aware Training (CAT) method is proposed to explicitly learn to distinguish relations.
arXiv Detail & Related papers (2020-10-21T11:07:53Z) - Pairwise Supervision Can Provably Elicit a Decision Boundary [84.58020117487898]
Similarity learning is a problem to elicit useful representations by predicting the relationship between a pair of patterns.
We show that similarity learning is capable of solving binary classification by directly eliciting a decision boundary.
arXiv Detail & Related papers (2020-06-11T05:35:16Z) - Rethinking Class Relations: Absolute-relative Supervised and
Unsupervised Few-shot Learning [157.62595449130973]
We study the fundamental problem of simplistic class modeling in current few-shot learning methods.
We propose a novel Absolute-relative Learning paradigm to fully take advantage of label information to refine the image representations.
arXiv Detail & Related papers (2020-01-12T12:25:46Z)
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.