Exploiting Global Semantic Similarities in Knowledge Graphs by
Relational Prototype Entities
- URL: http://arxiv.org/abs/2206.08021v1
- Date: Thu, 16 Jun 2022 09:25:33 GMT
- Title: Exploiting Global Semantic Similarities in Knowledge Graphs by
Relational Prototype Entities
- Authors: Xueliang Wang, Jiajun Chen, Feng Wu, Jie Wang
- Abstract summary: An empirical observation is that the head and tail entities connected by the same relation often share similar semantic attributes.
We propose a novel approach, which introduces a set of virtual nodes called textittextbfrelational prototype entities.
By enforcing the entities' embeddings close to their associated prototypes' embeddings, our approach can effectively encourage the global semantic similarities of entities.
- Score: 55.952077365016066
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge graph (KG) embedding aims at learning the latent representations
for entities and relations of a KG in continuous vector spaces. An empirical
observation is that the head (tail) entities connected by the same relation
often share similar semantic attributes -- specifically, they often belong to
the same category -- no matter how far away they are from each other in the KG;
that is, they share global semantic similarities. However, many existing
methods derive KG embeddings based on the local information, which fail to
effectively capture such global semantic similarities among entities. To
address this challenge, we propose a novel approach, which introduces a set of
virtual nodes called \textit{\textbf{relational prototype entities}} to
represent the prototypes of the head and tail entities connected by the same
relations. By enforcing the entities' embeddings close to their associated
prototypes' embeddings, our approach can effectively encourage the global
semantic similarities of entities -- that can be far away in the KG --
connected by the same relation. Experiments on the entity alignment and KG
completion tasks demonstrate that our approach significantly outperforms recent
state-of-the-arts.
Related papers
- Do Similar Entities have Similar Embeddings? [2.9498907601878974]
Knowledge graph embedding models (KGEMs) developed for link prediction learn vector representations for entities in a knowledge graph, known as embeddings.
A common assumption is the KGE entity similarity assumption, which states that these KGEMs retain the graph's structure within their embedding space.
Yet, the relation of entity similarity and similarity in the embedding space has rarely been formally evaluated.
This paper challenges the prevailing assumption that entity similarity in the graph is inherently mirrored in the embedding space.
arXiv Detail & Related papers (2023-12-16T08:08:36Z) - Duality-Induced Regularizer for Semantic Matching Knowledge Graph
Embeddings [70.390286614242]
We propose a novel regularizer -- namely, DUality-induced RegulArizer (DURA) -- which effectively encourages the entities with similar semantics to have similar embeddings.
Experiments demonstrate that DURA consistently and significantly improves the performance of state-of-the-art semantic matching models.
arXiv Detail & Related papers (2022-03-24T09:24:39Z) - Exploiting Transitivity Constraints for Entity Matching in Knowledge
Graphs [1.7080853582489066]
We show that an ad-hoc enforcement of transitivity on identified set of entity pairs may decrease precision dramatically.
We propose a methodology that starts with a given similarity measure, generates a set of entity pairs that are identified as referring to the same real-world objects, and applies the cluster editing algorithm to enforce transitivity without adding many spurious links.
arXiv Detail & Related papers (2021-04-22T10:57:01Z) - RAGA: Relation-aware Graph Attention Networks for Global Entity
Alignment [14.287681294725438]
We propose a novel framework based on Relation-aware Graph Attention Networks to capture the interactions between entities and relations.
Our framework adopts the self-attention mechanism to spread entity information to the relations and then aggregate relation information back to entities.
arXiv Detail & Related papers (2021-03-01T06:30:51Z) - Cross-Supervised Joint-Event-Extraction with Heterogeneous Information
Networks [61.950353376870154]
Joint-event-extraction is a sequence-to-sequence labeling task with a tag set composed of tags of triggers and entities.
We propose a Cross-Supervised Mechanism (CSM) to alternately supervise the extraction of triggers or entities.
Our approach outperforms the state-of-the-art methods in both entity and trigger extraction.
arXiv Detail & Related papers (2020-10-13T11:51:17Z) - Visual Pivoting for (Unsupervised) Entity Alignment [93.82387952905756]
This work studies the use of visual semantic representations to align entities in heterogeneous knowledge graphs (KGs)
We show that the proposed new approach, EVA, creates a holistic entity representation that provides strong signals for cross-graph entity alignment.
arXiv Detail & Related papers (2020-09-28T20:09:40Z) - ConsNet: Learning Consistency Graph for Zero-Shot Human-Object
Interaction Detection [101.56529337489417]
We consider the problem of Human-Object Interaction (HOI) Detection, which aims to locate and recognize HOI instances in the form of human, action, object> in images.
We argue that multi-level consistencies among objects, actions and interactions are strong cues for generating semantic representations of rare or previously unseen HOIs.
Our model takes visual features of candidate human-object pairs and word embeddings of HOI labels as inputs, maps them into visual-semantic joint embedding space and obtains detection results by measuring their similarities.
arXiv Detail & Related papers (2020-08-14T09:11:18Z) - Connecting Embeddings for Knowledge Graph Entity Typing [22.617375045752084]
Knowledge graph (KG) entity typing aims at inferring possible missing entity type instances in KG.
We propose a novel approach for KG entity typing which is trained by jointly utilizing local typing knowledge from existing entity type assertions and global triple knowledge from KGs.
arXiv Detail & Related papers (2020-07-21T15:00:01Z) - On the Role of Conceptualization in Commonsense Knowledge Graph
Construction [59.39512925793171]
Commonsense knowledge graphs (CKGs) like Atomic and ASER are substantially different from conventional KGs.
We introduce to CKG construction methods conceptualization to view entities mentioned in text as instances of specific concepts or vice versa.
Our methods can effectively identify plausible triples and expand the KG by triples of both new nodes and edges of high diversity and novelty.
arXiv Detail & Related papers (2020-03-06T14:35:20Z) - End-to-End Entity Linking and Disambiguation leveraging Word and
Knowledge Graph Embeddings [20.4826750211045]
We propose the first end-to-end neural network approach that employs KG as well as word embeddings to perform joint relation and entity classification of simple questions.
An empirical evaluation shows that the proposed approach achieves a performance comparable to state-of-the-art entity linking.
arXiv Detail & Related papers (2020-02-25T19:07:54Z)
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.