Pith. sign in

REVIEW 1 cited by

TeRo: A Time-aware Knowledge Graph Embedding via Temporal Rotation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.01029 v2 pith:PRSRAP72 submitted 2020-10-02 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords embeddingtimetkgsmodelstemporalterobeencomplex
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In the last few years, there has been a surge of interest in learning representations of entitiesand relations in knowledge graph (KG). However, the recent availability of temporal knowledgegraphs (TKGs) that contain time information for each fact created the need for reasoning overtime in such TKGs. In this regard, we present a new approach of TKG embedding, TeRo, which defines the temporal evolution of entity embedding as a rotation from the initial time to the currenttime in the complex vector space. Specially, for facts involving time intervals, each relation isrepresented as a pair of dual complex embeddings to handle the beginning and the end of therelation, respectively. We show our proposed model overcomes the limitations of the existing KG embedding models and TKG embedding models and has the ability of learning and inferringvarious relation patterns over time. Experimental results on four different TKGs show that TeRo significantly outperforms existing state-of-the-art models for link prediction. In addition, we analyze the effect of time granularity on link prediction over TKGs, which as far as we know hasnot been investigated in previous literature.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. VITA: Versatile Time Representation Learning for Temporal Hyper-Relational Knowledge Graphs

    cs.AI 2025-05 conditional novelty 5.0 of 10

    VITA uses a (conjunction, start, end) time triplet and an encoder-decoder Transformer to predict missing entities, relations, times, and numeric literals in temporal hyper-relational knowledge graphs, outperforming ba...

Pith tools