A Review of Knowledge Graph Completion

Information extraction methods proved to be effective at triple extraction from structured or unstructured data. The organization of such triples in the form of (head entity, relation, tail entity) is called the construction of Knowledge Graphs (KGs). Most of the current knowledge graphs are incompl...

Full description

Saved in:
Bibliographic Details
Published in:Information (Basel) 2022-08, Vol.13 (8), p.396
Main Authors: Zamini, Mohamad, Reza, Hassan, Rabiei, Minou
Format: Article
Language:English
Subjects:
Artificial intelligence
Datasets
Graph neural networks
Graphical representations
Graphs
information extraction
Information retrieval
knowledge graph embeddings
knowledge graphs
Knowledge representation
Learning
Machine learning
Neural networks
Semantic web
Semantics
Unstructured data
Vector spaces
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Information extraction methods proved to be effective at triple extraction from structured or unstructured data. The organization of such triples in the form of (head entity, relation, tail entity) is called the construction of Knowledge Graphs (KGs). Most of the current knowledge graphs are incomplete. In order to use KGs in downstream tasks, it is desirable to predict missing links in KGs. Different approaches have been recently proposed for representation learning of KGs by embedding both entities and relations into a low-dimensional vector space aiming to predict unknown triples based on previously visited triples. According to how the triples will be treated independently or dependently, we divided the task of knowledge graph completion into conventional and graph neural network representation learning and we discuss them in more detail. In conventional approaches, each triple will be processed independently and in GNN-based approaches, triples also consider their local neighborhood.
ISSN:2078-2489
2078-2489
DOI:10.3390/info13080396