Article Dans Une Revue Computer Science Review Année : 2024

Knowledge graph representation learning: a comprehensive and experimental overview

Dorssaf Sellami
  • Fonction : Auteur
Imed Riadh Farah
Sabeur Aridhi

Résumé

Knowledge graph embedding (KGE) is a hot topic in the field of Knowledge graphs (KG). It aims to transform KG entities and relations into vector representations, facilitating their manipulation in various application tasks and real-world scenarios. So far, numerous models have been developed in KGE to perform KG embedding. However, several challenges must be addressed when designing effective KGE models. The most discussed challenges in the literature include scalability (KGs contain millions of entities and relations), incompleteness (missing links), the complexity of relations (symmetries, inversion, composition, etc.), and the sparsity of some entities and relations. The purpose of this paper is to provide a comprehensive overview of KGE models. We begin with a theoretical analysis and comparison of the existing methods proposed so far for generating KGE, which we have classified into four categories. We then conducted experiments using four benchmark datasets to compare the efficacy, efficiency, inductiveness, the electricity and the CO2 emission of five state-of-the-art methods in the link prediction task, providing a comprehensive analysis of the most commonly used benchmarks in the literature.

Fichier principal
Vignette du fichier
Elsevier_Article__elsarticle__Template (4).pdf (1.89 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-04853146 , version 1 (02-01-2025)

Licence

Identifiants

  • HAL Id : hal-04853146 , version 1

Citer

Dorssaf Sellami, Wissem Inoubli, Imed Riadh Farah, Sabeur Aridhi. Knowledge graph representation learning: a comprehensive and experimental overview. Computer Science Review, 2024, 56. ⟨hal-04853146⟩
155 Consultations
1764 Téléchargements

Partager

  • More