atlas

Research map / Graph learning / Knowledge and temporal graphs

Temporal Network Embedding with High-Order Nonlinear Information

AAAI 2020 · Graph learning › Knowledge and temporal graphs · approach: Temporal graph neural architectures · 19 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
temporal embedding (HNIP) vs best baselineHNIP · DBLP link predictionprecision@100: 0.41 -> 0.43Helped
HNIP vs best baselineHNIP · Twitter link predictionprecision@100: 0.22 -> 0.27Helped
HNIP vs CTDNE at larger kHNIP · Twitter link predictionprecision@5000: 0.117 -> 0.081Hurt
temporal embedding methods vs static methodstemporal embeddings · DBLP link predictionprecision@k: HNIP 0.43 vs DeepWalk 0.33 at P@100Helped
HNIP vs static DeepWalk on reconstructionHNIP · Facebook network reconstructionprecision@10000: 0.469 -> 0.402Hurt

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