Browse State-of-the-Art › Triple Classification
Triple Classification
23 papers with code · 1 benchmark · 4 datasets archive 2025-07-28
Triple classification aims to judge whether a given triple (h, r, t) is correct or not with respect to the knowledge graph.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
1 leaderboard table shown for this task, 1 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.
| Dataset | Best model (first row in archive order) | Paper | Code | Syntology | Compare |
|---|---|---|---|---|---|
| YAGO39K (1 row) | TransC (bern) | Differentiating Concepts and Instances for Knowledge Graph Embedding | code | Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified | Compare |
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. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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
4 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
1 subtask in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 45 · with a code link: 23 · where Syntology ran a sample: 4 (3 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (4 of 45 tagged: 3 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 45 of 45, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
7 Sep 2019 3 repositories listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples) · 1 pointer-only (licence)Knowledge graphs are important resources for many artificial intelligence tasks but often suffer from incompleteness.
-
16 Sep 2020 2 repositories listedWe present CoDEx, a set of knowledge graph completion datasets extracted from Wikidata and Wikipedia that improve upon existing knowledge graph completion benchmarks in scope and level of difficulty.
-
2 Jan 2020 2 repositories listed Syntology official: harvested, nothing ran · 0 ran · 2 unverified (of 2 harvested samples)The main idea is to frame the task of triple classification as a debate game between two reinforcement learning agents which extract arguments -- paths in the knowledge graph -- with the goal to promote the fact being…
-
28 Dec 2018 2 repositories listedKnowledge representation learning (KRL) aims to represent entities and relations in knowledge graph in low-dimensional semantic space, which have been widely used in massive knowledge-driven tasks.
-
25 Jan 2015 2 repositories listedKnowledge graph completion aims to perform link prediction between entities.
-
15 Apr 2024 1 repository listedIn this paper, we investigate three crucial processes relevant to real-world construction scenarios: (a) the verification process, which arises from the necessity and limitations of human verifiers; (b) the mining…
-
20 Jan 2024 1 repository listedExtensional knowledge provides information about the concrete instances that belong to specific concepts in the ontology, while intensional knowledge details inherent properties, characteristics, and semantic…
-
23 Oct 2023 1 repository listedGraph data structures are widely used to store relational information between several entities.
-
28 Sep 2023 1 repository listedMost knowledge graph completion (KGC) methods learn latent representations of entities and relations of a given graph by mapping them into a vector space.
-
26 Aug 2023 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)Knowledge graphs play a vital role in numerous artificial intelligence tasks, yet they frequently face the issue of incompleteness.
-
17 May 2023 1 repository listedRecent work on knowledge graph completion (KGC) focused on learning embeddings of entities and relations in knowledge graphs.
-
3 Mar 2023 1 repository listedThrough experiments, we justify that the pretrained KGTransformer could be used off the shelf as a general and effective KRF module across KG-related tasks.
-
18 Nov 2022 1 repository listedThis paper adopts a transformer-based triplet network creating an embedding space that clusters the information about an entity or relation in the KG.
-
22 Aug 2022 1 repository listedThe majority of knowledge graph embedding techniques treat entities and predicates as separate embedding matrices, using aggregation functions to build a representation of the input triple.
-
19 Aug 2022 1 repository listedKnowledge graph completion (KGC) aims to discover missing relationships between entities in knowledge graphs (KGs).
-
25 Jun 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result (of 1 harvested sample) · 1 pointer-only (licence)In this paper, we propose LMKE, which adopts Language Models to derive Knowledge Embeddings, aiming at both enriching representations of long-tail entities and solving problems of prior description-based methods.
-
17 May 2021 1 repository listedHowever, for multiple cross-domain knowledge graphs, state-of-the-art embedding models cannot make full use of the data from different knowledge domains while preserving the privacy of exchanged data.
-
1 Jul 2020 1 repository listedWe propose TransINT, a novel and interpretable KG embedding method that isomorphically preserves the implication ordering among relations in the embedding space.
-
6 Mar 2020 1 repository listedCommonsense knowledge graphs (CKGs) like Atomic and ASER are substantially different from conventional KGs as they consist of much larger number of nodes formed by loosely-structured text, which, though, enables them to…
-
13 Jul 2019 1 repository listedKnowledge graph embedding methods often suffer from a limitation of memorizing valid triples to predict new ones for triple classification and search personalization problems.
-
12 Nov 2018 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified (of 3 harvested samples) · 3 pointer-only (licence)Most conventional knowledge embedding methods encode both entities (concepts and instances) and relations as vectors in a low dimensional semantic space equally, ignoring the difference between concepts and instances.
-
9 May 2017 1 repository listedExperimental results demonstrate that our confidence-aware models achieve significant and consistent improvements on all tasks, which confirms the capability of CKRL modeling confidence with structural information in…
-
22 Sep 2016 1 repository listedMore specifically, we first construct representations for all images of an entity with a neural image encoder.
-
On Large-scale Evaluation of Embedding Models for Knowledge Graph Completion11 Apr 2025 0 repositories listedKnowledge graph embedding (KGE) models are extensively studied for knowledge graph completion, yet their evaluation remains constrained by unrealistic benchmarks.
-
Self-supervised Quantized Representation for Seamlessly Integrating Knowledge Graphs with Large Language Models30 Jan 2025 0 repositories listedDue to the presence of the natural gap between Knowledge Graph (KG) structures and the natural language, the effective integration of holistic structural information of KGs with Large Language Models (LLMs) has emerged…
-
Efficient Relational Context Perception for Knowledge Graph Completion31 Dec 2024 0 repositories listedKnowledge Graphs (KGs) provide a structured representation of knowledge but often suffer from challenges of incompleteness.
-
Structural damage detection via hierarchical damage information with volumetric assessment29 Jul 2024 0 repositories listedStructural health monitoring (SHM) is essential for ensuring the safety and longevity of infrastructure, but complex image environments, noisy labels, and reliance on manual damage assessments often hinder its…
-
Using Knowledge Graphs for Performance Prediction of Modular Optimization Algorithms24 Jan 2023 0 repositories listedEmpirical data plays an important role in evolutionary computation research.
-
OneRel:Joint Entity and Relation Extraction with One Module in One Step10 Mar 2022 0 repositories listedJoint entity and relation extraction is an essential task in natural language processing and knowledge graph construction.
-
Improving Knowledge Graph Representation Learning by Structure Contextual Pre-training8 Dec 2021 0 repositories listedRepresentation learning models for Knowledge Graphs (KG) have proven to be effective in encoding structural information and performing reasoning over KGs.
-
Triple Classification for Scholarly Knowledge Graph Completion23 Nov 2021 0 repositories listed
-
Pre-training Language Model Incorporating Domain-specific Heterogeneous Knowledge into A Unified Representation2 Sep 2021 0 repositories listed
-
Membership Inference Attacks on Knowledge Graphs16 Apr 2021 0 repositories listed
-
Learning Structured Embeddings of Knowledge Graphs with Adversarial Learning Framework15 Apr 2020 0 repositories listed
-
Revisiting Evaluation of Knowledge Base Completion Models14 Feb 2020 0 repositories listed
-
Debate Dynamics for Human-comprehensible Fact-checking on Knowledge Graphs9 Jan 2020 0 repositories listed
-
Neural Markov Logic Networks31 May 2019 0 repositories listed
-
Logic Rules Powered Knowledge Graph Embedding9 Mar 2019 0 repositories listed
-
DOLORES: Deep Contextualized Knowledge Graph Embeddings31 Oct 2018 0 repositories listed
-
A Multimodal Translation-Based Approach for Knowledge Graph Representation Learning1 Jun 2018 0 repositories listed
-
Accurate Text-Enhanced Knowledge Graph Representation Learning1 Jun 2018 0 repositories listed
-
Knowledge Representation via Joint Learning of Sequential Text and Knowledge Graphs22 Sep 2016 0 repositories listed
-
Neighborhood Mixture Model for Knowledge Base Completion21 Jun 2016 0 repositories listed
-
24 Mar 2016 0 repositories listed
-
Knowlege Graph Embedding by Flexible Translation20 May 2015 0 repositories listed
Syntology lines on 5 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; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
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