Browse State-of-the-Art › Knowledge Graph Completion

Knowledge Graph Completion

251 papers with code · 7 benchmarks · 16 datasets archive 2025-07-28

GraphsKnowledge BaseNatural Language Processing

Knowledge graphs G are represented as a collection of triples (h, r, t) ⊆E×R×E, where E and R are the entity set and relation set. The task of Knowledge Graph Completion is to either predict unseen relations r between two existing entities: (h, ?, t) or predict the tail entity t given the head entity and the query relation: (h, r, ?).

Source: One-Shot Relational Learning for Knowledge Graphs

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

7 leaderboard tables shown for this task, 7 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.

Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. A dash means no Syntology record for that paper, not a recorded non-run. Read from the graph 2026-09-24.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

16 datasets whose archive record lists this task, ordered by the archive's paper count.

Subtasks archive 2025-07-28

4 subtasks in the archive's task tree.

Parent tasks archive 2025-07-28

Most implemented papers archive 2025-07-28

30 shown of 251 papers with code (482 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.

Syntology lines on 11 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.

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