Indexed by:
Abstract:
In this paper, we look at the problem of completing an open-world knowledge graph by describing entities. Many open-world knowledge graph completion (KGC) models train alignment functions that map embeddings based on textual descriptions to structural embedding spaces. They then use traditional closed-world KGC models to predict missing facts. When generating and aligning textual embeddings for the open world knowledge graph completion task, most existing approaches ignore the effect of relations. This means that noise from the texts gets into feature extraction, which hurts model performance. So, a new open-world KGC model called EmReCo is proposed. It is based on relation-specific constraints and focuses on relation-correlated information extraction from entity descriptions with a relation-aware attention aggregator for better textual embeddings. A relation-specific gate filtering mechanism is also made to keep relation-specific features in the entity embeddings. Extensive tests on two benchmark open-world datasets show that EmReCo gets great results, especially with long text datasets, and that the best metric, Hits@1, can get better by 8.1%.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
APPLIED INTELLIGENCE
ISSN: 0924-669X
Year: 2022
Issue: 12
Volume: 53
Page: 16192-16204
5 . 3
JCR@2022
3 . 4 0 0
JCR@2023
ESI Discipline: ENGINEERING;
ESI HC Threshold:66
JCR Journal Grade:2
CAS Journal Grade:2
Cited Count:
WoS CC Cited Count: 3
SCOPUS Cited Count: 4
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 0
Affiliated Colleges: