Papers › Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective

Analyzing Knowledge Graph Embedding Methods from a Multi-Embedding Interaction Perspective

27 Mar 2019arXiv:1903.11406archive 2025-07-28

Hung Nghiep Tran, Atsuhiro Takasu

Knowledge graph is a popular format for representing knowledge, with many applications to semantic search engines, question-answering systems, and recommender systems. Real-world knowledge graphs are usually incomplete, so knowledge graph embedding methods, such as Canonical decomposition/Parallel factorization (CP), DistMult, and ComplEx, have been proposed to address this issue. These methods represent entities and relations as embedding vectors in semantic space and predict the links between them. The embedding vectors themselves contain rich semantic information and can be used in other applications such as data analysis. However, mechanisms in these models and the embedding vectors themselves vary greatly, making it difficult to understand and compare them. Given this lack of understanding, we risk using them ineffectively or incorrectly, particularly for complicated models, such as CP, with two role-based embedding vectors, or the state-of-the-art ComplEx model, with complex-valued embedding vectors. In this paper, we propose a multi-embedding interaction mechanism as a new approach to uniting and generalizing these models. We derive them theoretically via this mechanism and provide empirical analyses and comparisons between them. We also propose a new multi-embedding model based on quaternion algebra and show that it achieves promising results using popular benchmarks. Source code is available on GitHub at https://github.com/tranhungnghiep/AnalyzeKGE.

PaperPDFConference PDFCode

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

Code

tranhungnghiep/AnalyzeKGE officialmentioned in papermentioned on GitHubtf report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink PredictionQuestion AnsweringRecommendation SystemsWorld Knowledge

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Link Prediction WN18 Quaternion Hits@1 0.931 #16 of 37 Archive leaderboard report
Link Prediction WN18 Quaternion Hits@10 0.956 #16 of 37 Archive leaderboard report
Link Prediction WN18 Quaternion Hits@3 0.950 #16 of 37 Archive leaderboard report
Link Prediction WN18 Quaternion MRR 0.941 #16 of 37 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Methods

MEI

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections