Pith. sign in

REVIEW 3 cited by

Temporal Knowledge Graph Embedding Model based on Additive Time Series Decomposition

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 1911.07893 v6 pith:FEXMRB3C submitted 2019-11-18 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords temporalembeddingtimeentitymodelrelationrepresentationsadditive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Knowledge Graph (KG) embedding has attracted more attention in recent years. Most KG embedding models learn from time-unaware triples. However, the inclusion of temporal information beside triples would further improve the performance of a KGE model. In this regard, we propose ATiSE, a temporal KG embedding model which incorporates time information into entity/relation representations by using Additive Time Series decomposition. Moreover, considering the temporal uncertainty during the evolution of entity/relation representations over time, we map the representations of temporal KGs into the space of multi-dimensional Gaussian distributions. The mean of each entity/relation embedding at a time step shows the current expected position, whereas its covariance (which is temporally stationary) represents its temporal uncertainty. Experimental results show that ATiSE chieves the state-of-the-art on link prediction over four temporal KGs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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...

  2. Towards Improving Long-Tail Entity Predictions in Temporal Knowledge Graphs through Global Similarity and Weighted Sampling

    cs.AI 2025-07 reject novelty 4.0 of 10

    A global relation-similarity enhancement layer plus frequency-weighted sampling improves long-tail entity link prediction in incrementally trained temporal knowledge graphs on the ICEWS14 and ICEWS18 benchmarks.

  3. Load Forecasting on A Highly Sparse Electrical Load Dataset Using Gaussian Interpolation

    cs.LG 2025-08 reject novelty 3.0 of 10

    The authors claim Gaussian-interpolated sparse campus load data enables load forecasting, with LSTM achieving a 10.67% MAPE, but the reported accuracy is measured against the very imputations the method creates.

Pith tools