atlas

Research map / Graph learning / Knowledge and temporal graphs

Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs

ICLR 2023 · Graph learning › Knowledge and temporal graphs · approach: Temporal graph neural architectures · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use TDLG edge proximity features instead of the compared temporal embedding methodsedge classification · five real-world datasetsAUCHelped
use TDLG edge proximity features instead of the compared methodsinterpolative link outlier detection · five real-world datasetsAUCHelped
use TDLG edge proximity features instead of the compared methodsextrapolative temporal link prediction · five real-world datasetsAUCHelped
replace sparse TDLG row features with top 128 eigenvector features (ablation)TDLG · edge classification, all reported datasetsAUCHurt
vary the time-decay scale across the tested range (ablation)TDLG · BitcoinAlpha, BitcoinOTC, Escorts, WikiElect edge classificationAUCMixed
normalize TDLG adjacency with spectral or edge normalization rather than leaving it unnormalized (ablation)TDLG · edge classification, tested datasetsAUCHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy